The classical Baldwin-Lachlan characterization of uncountably categorical theories is known to fail in continuous logic in that not every inseparably categorical theory has a strongly minimal set. Here we investigate these issues by developing the theory of strongly minimal sets in continuous logic and by examining inseparably categorical expansions of Banach space.
To this end we introduce and characterize 'dictionaric theories,' theories in which definable sets are prevalent enough that many constructions familiar in discrete logic can be carried out. We also introduce, in the context of Banach theories, the notion of an 'indiscernible subspace,' which we use to improve a result of Shelah and Usvyatsov. Both of these notions are applicable to continuous logic outside of the context of inseparably categorical theories.
Finally, we construct or present a slew of counterexamples, including an $ω$-stable theory with no Vaughtian pairs which fails to be inseparably categorical and an inseparably categorical theory with strongly minimal sets in its home sort only over models of sufficiently high dimension.
We explore approximate categoricity in the context of distortion systems, introduced in our previous paper, which are a mild generalization of perturbation systems, introduced by Ben Yaacov. We extend Ben Yaacov's Ryll-Nardzewski style characterization of separably approximately categorical theories from the context of perturbation systems to that of distortion systems. We also make progress towards an analog of Morley's theorem for inseparable approximate categoricity, showing that if there is some uncountable cardinal $κ$ such that every model of size $κ$ is 'approximately saturated,' in the…
We point out a gap in Shelah's proof of the following result: $\mathbf{Claim}$ Let $K$ be an abstract elementary class categorical in unboundedly many cardinals. Then there exists a cardinal $λ$ such that whenever $M, N \in K$ have size at least $λ$, $M \le N$ if and only if $M \preceq_{L_{\infty, \text{LS} (K)^+}} N$. The importance of the claim lies in the following theorem, implicit in Shelah's work: $\mathbf{Theorem}$ Assume the claim. Let $K$ be an abstract elementary class categorical in unboundedly many cardinals. Then the class of $λ$ such that: 1) $K$ is categorical in $λ$; 2) $K$ has…
Informally speaking, the categoricity of an axiom system means that its non-logical symbols have only one possible interpretation that renders the axioms true. Although non-categoricity has become ubiquitous in the second half of the 20th century whether one looks at number theory, geometry or analysis, the first axiomatizations of such mathematical theories by Dedekind, Hilbert, Huntington, Peano and Veblen were indeed categorical. A common resolution of the difference between the earlier categorical axiomatizations and the more modern non-categorical axiomatizations is that the latter derive…
We show that intuitionistic propositional logic is \emph{Carnap categorical}: the only interpretation of the connectives consistent with the intuitionistic consequence relation is the standard interpretation. This holds relative to the most well-known semantics with respect to which intuitionistic logic is sound and complete; among them Kripke semantics, Beth semantics, Dragalin semantics, and topological semantics. It also holds for algebraic semantics, although categoricity in that case is different in kind from categoricity relative to possible worlds style semantics.
Essential $\aleph_0$-categoricity; i.e., $\aleph_0$-categoricity in some full countable language, is shown to be a robust notion for strongly minimal compact complex manifolds. Characterisations of triviality and essential $\aleph_0$-categoricity are given in terms of complex-analytic automorphisms, in the simply connected case, and correspondences in general. As a consequence it is pointed out that an example of McMullen yields a strongly minimal compact Kähler manifold with trivial geometry but which is not $\aleph_0$-categorical, giving a counterexample to a conjecture of the second author …
We prove the following continuous analogue of Vaught's Two-Cardinal Theorem: if for some $κ>λ\geq \aleph_0$, a continuous theory $T$ has a model with density character $κ$ which has a definable subset of density character $λ$, then $T$ has a model with density character $\aleph_1$ which has a separable definable subset. We also show that if we assume that $T$ is $ω$-stable, then if $T$ has a model of density character $\aleph_1$ with a separable definable set, then for any uncountable $κ$ we can find a model of $T$ with density character $κ$ which has a separable definable subset. In order to …
The Kuroda negative translation translates classical logic only into intuitionistic logic, not into minimal logic. We present eight variants of the Kuroda negative translation that translate classical logic even into minimal logic. The proofs of their soundness theorems are interesting because they illustrate four different methods of proof.
We study approximate $\aleph_0$-categoricity of theories of beautiful pairs of randomizations, in the sense of continuous logic. This leads us to disprove a conjecture of Ben Yaacov, Berenstein and Henson, by exhibiting $\aleph_0$-categorical, $\aleph_0$-stable metric theories $Q$ for which the corresponding theory $Q_P$ of beautiful pairs is not approximately $\aleph_0$-categorical, i.e., has separable models that are not isomorphic even up to small perturbations of the smaller model of the pair. The theory $Q$ of randomized infinite vector spaces over a finite field is such an example. On th…
The so-called paradoxes of material implication have motivated the development of many non-classical logics over the years \cite{aA75,nB77,aA89,gP89,sH96}. In this note, we investigate some of these paradoxes and classify them, over minimal logic. We provide proofs of equivalence and semantic models separating the paradoxes where appropriate. A number of equivalent groups arise, all of which collapse with unrestricted use of double negation elimination. Interestingly, the principle \emph{ex falso quodlibet}, and several weaker principles, turn out to be distinguishable, giving perhaps supporti…
In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish some relations between mixed logic and minimal, intuitionistic and classical logics. We present at the end a sequent calculus version for this logic.
We study propositional logical systems arising from the language of Johansson's minimal logic and obtained by weakening the requirements for the negation operator. We present their semantics as a variant of neighbourhood semantics. We use duality and completeness results to show that there are uncountably many subminimal logics. We also give model-theoretic and algebraic definitions of filtration for minimal logic and show that they are dual to each other. These constructions ensure that the propositional minimal logic has the finite model property. Finally, we define and investigate bi-modal …
The article is a study of two algebraic structures, the `contrapositionally complemented pseudo-Boolean algebra' (ccpBa) and `contrapositionally $\vee$ complemented pseudo-Boolean algebra' (c$\vee$cpBa). The algebras have recently been obtained from a topos-theoretic study of categories of rough sets. The salient feature of these algebras is that there are two negations, one intuitionistic and another minimal in nature, along with a condition connecting the two operators. We study properties of these algebras, give examples, and compare them with relevant existing algebras. `Intuitionistic Log…
We propose a uniform way of defining for every logic ${\sf L}$ intermediate between intuitionistic and classical logics, the corresponding intermediate minimal tense logic ${\sf LK_t}$. This is done by building the fusion of two copies of intermediate logic with a Galois connection ${\sf LGC}$, and then interlinking their operators by two Fischer Servi axioms. The resulting system is called here ${\sf L2GC{+}FS}$. In the cases of intuitionistic logic ${\sf Int}$ and classical logic ${\sf Cl}$, it is noted that ${\sf Int2GC{+}FS}$ is syntactically equivalent to intuitionistic minimal tense logi…
The provability logic of a theory $T$ captures the structural behavior of formalized provability in $T$ as provable in $T$ itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability logics. Where provability logics are the same for all moderately sound theories of some minimal strength, interpretability logics do show variations. The logic IL(All) is defined as the collection of modal principles that are provable in any moderately sound theory of some minimal strength. In this paper we raise the previously known lower bound of IL(All) by…
The aim of this paper is to propose a many-valued modal framework to formalize reasoning with both graded preferences and propositions, in the style of van Benthem et al.'s classical modal logics for preferences. To do so, we start from Bou et al.'s minimal modal logic over a finite and linearly ordered residuated lattice. We then define appropriate extensions on a multi-modal language with graded modalities, both for weak and strict preferences, and with truth-constants. Actually, the presence of truth-constants in the language allows us to show that the modal operators Box and Diamond of the…
We propose an extension of minimal intuitionistic predicate logic, based on delimited control operators, that can derive the predicate-logic version of the Double-negation Shift schema, while preserving the disjunction and existence properties.
This paper investigates quantum logic from the perspective of categorical logic, and starts from minimal assumptions, namely the existence of involutions/daggers and kernels. The resulting structures turn out to (1) encompass many examples of interest, such as categories of relations, partial injections, Hilbert spaces (also modulo phase), and Boolean algebras, and (2) have interesting categorical/logical properties, in terms of kernel fibrations, such as existence of pullbacks, factorisation, and orthomodularity. For instance, the Sasaki hook and and-then connectives are obtained, as adjoints…
