SEARCH · Searcharxiv
Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
This addendum to math.LO/0412144 shows that the set of tautological quantum logical propositional formulas for a finite dimensional vector space C^n is different for every n, affirmatively answering a question posed therein.
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of reasonably bounding forcing notions. We use this to show that consistently there are reasonable ultrafilters on an inaccessible cardinal lambda with generating system of size less than 2^lambda . We also show how reasonable ultrafilters can be killed by forcing notions which have enough reasonable completeness to be iterated with lambda-supports (and we show the appropriate preservation theorem).
We give a survey with some explanations but no proofs of the new notion of b-minimality by the author and F. Loeser [b-minimality, J. Math. Log., 7 no. 2 (2007) 195--227, math.LO/0610183]. We compare this notion with other notions like o-minimality, C-minimality, p-minimality, and so on.
We prove the existence of pairs of models of the same cardinality lambda which are very equivalent according to EF games, but not isomorphic. We continue the paper math.LO/0404222, but we don't rely on it.
We investigate the existence of strong colorings on successors of singular cardinals. This work continues Section 2 of [Sh:413] (math.LO/9809199), but now our emphasis is on finding colorings of pairs of ordinals, rather than colorings of finite sets of ordinals.
A lattice L is called opc if every monotone function f : L^n -> L is induced by a polynomial. We show here: If L is a lattice with the interpolation property whose cardinality is a strong limit cardinal of uncountable cofinality, then some finite power L^n has an antichain of size kappa. Using our previous result (math.LO/9707203 in the xxx archive) that the cardinality of an infinite opc lattice must be inaccessible, we can now conclude that there are no infinite opc lattices. However, the existence of strongly amorphous sets implies (in ZF) the existence of infinite opc lattices.
We show that it is consistent with MA + the negation of CH, that the Forcing Axiom fails for all forcing notions in the class of omega^omega-bounding forcing notions with norms of "Norms on possibilities I: forcing with trees and creatures"(by Roslanowski and Shelah - math.LO/9807172).
We pay two debts from [Sh:576] (math.LO/9805146). The main demands little knowledge from [Sh:576], just quoting a model theoretic consequence of the weak diamond. We assume that K has amalgamation in lambda, and that the minimal types are not dense to get many non-isomorphic models in lambda^+. For this also pcf considerations are relevant. The minor debt was the use in one point of [Sh:576] of lambda not= aleph_0, it is minor as for this case by [Sh:88] we ``usually'' know more.
This is a non-standard paper, containing some problems, mainly in model theory, which I have, in various degrees, been interested in. Sometimes with a discussion on what I have to say; sometimes, of what makes them interesting to me, sometimes the problems are presented with a discussion of how I have tried to solve them, and sometimes with failed tries, anecdote and opinion. So the discussion is quite personal, in other words, egocentric and somewhat accidental. As we discuss many problems, history and side references are erratic, usually kept at a minimum ("See..." means: see the references there and possibly the paper itself). The base were lectures in Rutgers Fall '97 and reflect my knowledge then. The other half, math.LO/9906113, concentrating on set theory, is in print, but the two halves are independent. We thank A. Blass, G. Cherlin and R. Grossberg for some corrections.
For a cardinal kappa and a model M of cardinality kappa let No(M) denote the number of non-isomorphic models of cardinality kappa which are L_{infty,kappa}--equivalent to M. In [Sh:133] Shelah established that when kappa is a weakly compact cardinal and mu<=kappa is a nonzero cardinal, there exists a model M of cardinality kappa with No(M)=mu. We prove here that if kappa is a weakly compact cardinal, the question of the possible values of No(M) for models M of cardinality kappa is equivalent to the question of the possible numbers of equivalence classes of equivalence relations which are Sigma^1_1-definable over V_kappa. In math.LO/9911231 we prove that, consistent wise, the possible numbers of equivalence classes of Sigma^1_1-equivalence relations can be completely controlled under the singular cardinal hypothesis. These results settle the problem of the possible values of No(M) for models of weakly compact cardinality, provided that the singular cardinal hypothesis holds.
In this paper we argue that the Sasaki adjunction, which formally encodes the logicality that different authors tried to attach to the Sasaki hook as a `quantum implicative connective', has a fundamental dynamic nature and encodes the so-called `causal duality' (Coecke, Moore and Stubbe 2001; quant-ph/0009100) for the particular case of a quantum measurement with a projector as corresponding self-adjoint operator. In particular: The action of the Sasaki hook $(a\stackrel{S}{\to}-)$ for fixed antecedent $a$ assigns to some property ``the weakest cause before the measurement of actuality of that property after the measurement'', i.e. ${(a\stackrel{S}{\to}b)}$ is the weakest property that guarantees actuality of $b$ after performing the measurement represented by the projector that has the `subspace $a$' as eigenstates for eigenvalue 1, say, the measurement that `tests' $a$ . From this we conclude that the logicality attributable to quantum systems contains a fundamentally dynamic ingredient: Causal duality actually provides a new dynamic interpretation of orthomodularity. We also reconsider the status of the Sasaki hook within `dynamic (operational) quantum logic' (DOQL). We can derive two labeled dynamic hooks (forwardly and backwardly) that encode how quantum measurements act on properties. In an even more radical perspective one could say that the transition from either classical or constructive/intuitionistic logic to quantum logic entails besides the introduction of an additional unary connective `operational resolution' (Coecke 2001a; math.LO/0011208) the shift from a binary connective implication to a ternary connective where two of the arguments refer to qualities of the system and the third, the new one, to an obtained outcome (in a measurement).
We study varieties with a term-definable poset structure, "po-groupoids". It is known that connected posets have the "strict refinement property" (SRP). In [arXiv:0808.1860v1 [math.LO]] it is proved that semidegenerate varieties with the SRP have definable factor congruences and if the similarity type is finite, directly indecomposables are axiomatizable by a set of first-order sentences. We obtain such a set for semidegenerate varieties of connected po-groupoids and show its quantifier complexity is bounded in general.
If an extension Vbar of V satisfies the delta approximation and cover properties for classes and V is a class in Vbar, then every suitably closed embedding j:Vbar to Nbar in Vbar with critical point above delta restricts to an embedding j|V:V to N amenable to the ground model V. In such extensions, therefore, there are no new large cardinals above delta. This result extends work in math.LO/9808011.
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often associated with the name ``graph limits''. The language of graph limits is generally more intuitive and expressible, but a price that one has to pay for it is that it is better suited for the case of ordinary graphs than for more general combinatorial objects. Accordingly, there have been several attempts in the literature, of varying degree of generality, to define limit objects for more complicated combinatorial structures. This paper is another attempt at a workable general theory of dense limit objects. Unlike previous efforts in this direction (with notable exception of [Ashwini Aroskar and James Cummings. Limits, regularity and removal for finite structures. Technical Report arXiv:1412.2014 [math.LO], arXiv e-print, 2014.]), we base our account on the same concepts from the first-order logic and the model theory as in the theory of flag algebras. We show how our definition naturally encompasses a host of previously considered cases (graphons, hypergraphons, digraphons, permutons, posetons, colored graphs, etc.), and we extend the fundamental properties of existence and uniqueness to this more general case. We also give an intuitive general proof of the continuous version of the Induced Removal Lemma based on the completeness theorem for propositional calculus. We capitalize on the notion of an open interpretation that often allows to transfer methods and results from one situation to another. Again, we show that some previous arguments can be quite naturally framed using this language.
We prove that in some cases definable chains of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic chains, ROD chains in the Solovay model, and $Σ^1_2$ chains in the assumption that $ω_1^{L[x]}<ω_1$ for all reals $x$.
It is true in the Solovay model that every countable ordinal-definable set of sets of reals contains only ordinal-definable elements.
We show that a version of López-Escobar's theorem holds in the setting of logic for metric structures. More precisely, let $\mathbb{U}$ denote the Urysohn sphere and let $\mathrm{Mod}(\mathcal{L},\mathbb{U})$ be the space of metric $\mathcal{L}$-structures supported on $\mathbb{U}$. Then for any $\mathrm{Iso}(\mathbb{U})$-invariant Borel function $f\colon \mathrm{Mod}(\mathcal{L}, \mathbb{U})\rightarrow \lbrack 0,1]$, there exists a sentence $ϕ$ of $\mathcal{L}_{ω_{1}ω}$ such that for all $M\in \mathrm{Mod}(\mathcal{L},\mathbb{U})$ we have $f(M)=ϕ^{M}$. At the same time we introduce a variant $\mathcal{L}_{ω_1ω}^\ast$ of $\mathcal{L}_{ω_1ω}$ in which the usual quantifiers are replaced with category quantifiers, and establish the analogous theorem for $\mathcal{L}_{ω_1ω}^\ast$. This answers a question of Ivanov and Majcher-Iwanow. We prove several consequences, for example every orbit equivalence relation of a Polish group action is Borel isomorphic to the isomorphism relation on the set of models of a given $\mathcal{L}_{ω_{1}ω}$-sentence that are supported on the Urysohn sphere. This in turn provides a model-theoretic reformulation of the topological Vaught conjecture.
We exhibit two relation algebra atom structures such that they are elementarily equivalent but their term algebras are not. This answers Problem 14.19 in the book Hirsch, R. and Hodkinson, I., "Relation Algebras by Games", North-Holland, 2002.