Related papers: Pointwise Definable Models of Set Theory
Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…
We study semantic and syntactic properties of spherical orders and their elementary theories, including finite and dense orders and their theories. It is shown that theories of dense $n$-spherical orders are countably categorical and…
We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree…
We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…
We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…
I introduce an approach for automated reasoning in first order set theories that are not finitely axiomatizable, such as $ZFC$, and describe its implementation alongside the automated theorem proving software E. I then compare the results…
A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…
We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…
Overcomplete latent representations have been very popular for unsupervised feature learning in recent years. In this paper, we specify which overcomplete models can be identified given observable moments of a certain order. We consider…
The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…
The standard treatment of sets and definable classes in first-order Zermelo-Fraenkel set theory accords in many respects with the Fregean foundational framework, such as the distinction between objects and concepts. Nevertheless, in set…
We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…
This is a supplement to an earlier paper (PRD 84, 023510 (2011)), where those shearfree normal cosmological models were identified, in which all light rays have repeatable paths. All of them are conformally flat, but less general than the…
Researchers develop models to explain the unknowns. These models typically involve parameters that capture tangible quantities, the estimation of which is desired. Parameter identifiability investigates the recoverability of the unknown…
We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…
In this paper, we present full models for some Paraconsistent Set Theories (PSTs). These models are built over Fidel semantics where they are specific first-order structures in the sense of Model Theory. These structures are known as…
Given a model $\mathcal{M}$ of set theory, and a nontrivial automorphism $j$ of $\mathcal{M}$, let $\mathcal{I}_{\mathrm{fix}}(j)$ be the submodel of $\mathcal{M}$ whose universe consists of elements $m$ of $\mathcal{M}$ such that $j(x)=x$…
We introduce a general unifying framework for the investigation of pointlike sets. The pointlike functors are considered as distinguished elements of a certain lattice of subfunctors of the power semigroup functor; in particular, we exhibit…