4
votes
3answers
325 views

Systematic brute-force searches for counterexamples

This is getting nowhere on math.stackexchange.com, so I'm putting it here. Gödel's completeness theorem says that for every statement in first-order predicate calculus with equality, there is either ...
9
votes
2answers
382 views

What is the precise notion of “enough arithmetic” in Godel's first Incompleteness theorem?

I'm trying to reconstruct the proof of Godel's first theorem (Rosser's strong version) from the uncomputability of the Halting function. If we just started with the language $\mathcal{L}=\{0, S, +, ...
8
votes
2answers
248 views

The (non-)absoluteness of second-order elementary equivalence

Elementary equivalence is set-theoretically absolute between any two transitive models of set theory; this is also true for the infinitary logics - e.g., $\mathcal{L}_{\omega_1\omega}$ - at least, ...
0
votes
1answer
52 views

Preserving Predimension Functions under Functional Convergences

Definition 1. If ‎$‎‎‎\mathcal{L}‎$ ‎is a‎ ‎countable relational ‎language, ‎a ‎predimension ‎class ‎‎‎‎‎$‎C‎$ is a class ‎of $‎‎\mathcal{L}$-structures with ‎the ‎following ‎properties:‎ ‎C1: ...
2
votes
0answers
102 views

Preimages of accessible full subcategories

My question is ultimately about the model theory of $L_{\infty, \omega}$, but it is more convenient to phrase it in terms of category theory. Suppose I have finitely accessible categories ...
4
votes
1answer
127 views

Stable examples from Algebra such that the model theoretic algebraic closure of a substructre is no model

Let $T$ be a stable theory. Let $A$ be a subset or substructure of a model $M$ of $T$. Now in some theories the (model theoretic) algebraic closure of $A$ is already a (sub)model of $T$. For example, ...
4
votes
0answers
81 views

Relation between fundamental theorem of Ehrenfeucht-Fraisse games and notions of bisimulation and simulation

Vijay D alluded to the relation between the fundamental theorem of Ehrenfeucht-Fraisse games and notions of bisimulation and simulation in response to the whats-a-magical-theorem-in-logic question. ...
9
votes
3answers
328 views

Is a model of arithmetic contained in a model of arithmetic an initial segment?

It's easy enough to show that if $\mathbb{N}_1$ is a non-standard model of the Peano axioms, then there is a canonical embedding $\mathbb{N} \to \mathbb{N}_1$, and we have a theorem that if $x \in ...
10
votes
0answers
123 views

Maximality of linear orders in the Keisler order on theories

Recently Malliaris and Shelah (see their preprint http://math.uchicago.edu/~mem/Malliaris-Shelah-CST.pdf) have shown that theories with $SOP_2$ are maximal in the Keisler order. A preceding result of ...
1
vote
1answer
271 views

Compactness and completeness in Gödel logic

The standard proof of the completeness theorem in first-order Gödel logic is based on a first-order countable language. I want to know that is there any proof of the completeness theorem in ...
3
votes
0answers
127 views

Equational theories determined by “identities without variables”

How to characterize equational theories $T$ which have the following property: for any two terms $t(x_1,...,x_n)$ and $t'(x_1,...,x_n)$ in the signature of $T$, if for any closed terms (i. e. terms ...
3
votes
1answer
197 views

Colorful model theory

There are a number of concepts in model theory - often situated around Hrushovski's amalgamation method (see for instance http://math.univ-lyon1.fr/~wagner/nijmegen.pdf) - which are colorfully named: ...
4
votes
1answer
102 views

Replace Morley sequence over some set by one over a finite set, s.t. they both satiesfy a certain formula

Let $T$ be a stable $L$-theory with elimination of imaginaries. We work in the monster model $\mathfrak C$ of $T$. Let $A$ be a small (infinite) set of the monster, $\phi(x,y)$ be a $L(A)$-formula and ...
9
votes
3answers
735 views

Is it ever a good idea to use Keisler-Shelah to show elementary equivalence?

The most useful way I know to show that two structures are elementarily equivalent is Ehrenfeucht-Fraisse games. These are quite nice and intuitive, and even when I can't use them to solve my problem ...
4
votes
1answer
130 views

Finite generation of vector identities

This question is partially motivated by Looking for a comprehensive referece for vector identities, although that question may not be appropriate for MO. Consider the set $\mathcal{E}$ of all valid ...
5
votes
1answer
182 views

A ZFC construction to get a proper extension which is a $\omega_1$-model

In $V$, let me call a set theory structure A is a $\omega_1$ model if the $\omega_1$ of $A$ is the same as the $\omega_1$ in $V$ (up to isomorphism). The question I would like to ask is the following: ...
7
votes
2answers
220 views

Vaught's conjecture for partial orders

In ``Steel, John R. On Vaught's conjecture. Cabal Seminar 76–77, pp. 193–208'' the following is proved: Theorem. Let $\phi\in L_{\omega_1,\omega}.$ If every model of $\phi$ is a tree, then $\phi$ has ...
2
votes
3answers
290 views

Can a Decidable Theory Have Non-recursive Models?

Tennenbaums' theorem proves neither addition nor multiplication can be recursive in any countable non-standard model of arithmetic. Tennenbaum's proof applies to theories much weaker than PA. ...
4
votes
2answers
265 views

Forcing for Arbitrary First Order Theories

Forcing is a relative model construction method for models of $ZF$ as a particular first order theory using models of another first order theory (forcing companion) that in this case is the theory of ...
3
votes
3answers
273 views

Godel's Second Incompleteness theorem and Models

As I understand it, Godel's completeness theorem essentially says that if a sentence $\phi$ can be proven in a first order theory $\Gamma$, then $\phi$ is satisfied in all models $\mathcal{U}$ of ...
6
votes
0answers
141 views

“Fraïssé limits” without amalgamation

All structures are countable with countable signature. Given a structure $\mathcal{A}$, the age of $\mathcal{A}$, $Age(\mathcal{A})$, is the set of structures isomorphic to finitely-generated ...
6
votes
1answer
223 views

Fields of characteristic zero via ultraproducts

Is every noncountable field of characteristic zero the ultraproduct (using a non principal ultrafilter over the set of prime numbers) of fields of positive characteristic?
4
votes
0answers
78 views

Stabilization of recursive approximation in $PA^-+I\Sigma_1^0$

Over any model M of $PA^-+I\Sigma_1^0$. Suppose $A\in [T]$ where $T$ is a $\Delta_2^0$-tree and $A$ is one isolated path. Further, $A$ is regular, i.e. $\forall n A\upharpoonright n$ has a code in ...
2
votes
0answers
121 views

Algebras admitting quantifier elimination

I apologize if this question is meaningless or trivial: What are examples of Algebras admitting quantifier elimination? Especially are there Groups admitting quantifier elimination? I need to say ...
24
votes
1answer
2k views

A preprint of Sela concerning the work of Kharlampovich-Miyasnikov

Yesterday, Z. Sela published a preprint in arXiv which claims that the solution of Olga Kharlampovich and Alexi Miyasnikov for the Tarski problem on decidablity of the first order theories of free ...
0
votes
3answers
128 views

Negated varieties and their relatively free algebras

During the past days, I asked some questions in order to gain a clear understanding of the notion of "free algebras". I suppose that the question below is the most clear image of the concept I have ...
4
votes
3answers
242 views

The existence of an algebra whose set of identities and first order theory are equivalent

Is there an algebra $A$ (for example a group) such that $Th(A)$ is logically equivalent to $id(A)$? In other words, is there an algebra $A$ such that $$ Mod(Th(A))=Var(A)? $$ Clearly finite algebras ...
0
votes
1answer
145 views

relatively free groups in $Var(S_3)$

Suppose $S_3$ is the symmetric group of order 6. Which elements of the variety $Var(S_3)$ are relatively free? This question is related to my previous question Relatively free algebras in a variety ...
2
votes
0answers
90 views

Stability of analytic Zariski structures

Noetherian Zariski structures are introduced by Hrushovski and Zilber.(1996) An analytic Zariski structure is a generalization of Noetherian Zariski structures, introduced by Zilber and Peatfield. ...
10
votes
1answer
218 views

Is “approximate categoricity” absolute?

Let $T$ be a countable first-order theory, and assume that $T$ has exactly one atomic model up to isomorphism in every uncountable cardinality. (By "atomic" I mean a model which omits the ...
2
votes
0answers
95 views

Peano (Dedekind) categoricity

What is the smallest fragment of second order logic such that $Th(\mathbb{N})$ in that logic is categorical (only one model, namely natural numbers, up to isomorphism). For example, can we do this in ...
6
votes
1answer
224 views

Recursive ordinals and the minimal standard model of ZF

Does the minimal standard model of ZF contain all recursive ordinals or is it limited (probably by the proof theoretic ordinal of ZF as I suspect but cannot prove)? Paul J. Cohen's definition of the ...
3
votes
1answer
132 views

Outer Definability of a Class

Definition: Let $C$ be a class of sets and $\mathcal{L}$ a first order relational language. We say $C$ is "outer definable" by $\mathcal{L}$ if there is a first order theory $T$ and for each $n_{R}$ - ...
6
votes
1answer
186 views

Generalizations of Birkhoff's HSP Theorem

Let $\mathbf{C}$ be the class of algebraic structures of some fixed type satisfying some sentence $\phi$. Birkhoff's HSP theorem says that $\mathbf{C}$ is closed under homomorphisms, subalgebras and ...
2
votes
1answer
212 views

$(\kappa,\lambda)$ - Minimal Models & Stronger Version of Rowbottom's Theorem

Definition 1: Let $M$ be a $\mathcal{L}$ - structure and $A\subseteq Dom(M)$. Define: $Def_{A}(M):=\{X\subseteq Dom(M)~|~\exists n\in \omega~~\exists \varphi (x,y_1,...,y_n)\in ...
1
vote
1answer
245 views

$(\kappa , \lambda)$ - Minimal Models of $\text{ZF}$

The notion of minimality in model theory is related to the existence of a gap in the size of definable subsets of a model. Now consider the following generalization: Definition 1: Let $M$ be a ...
2
votes
1answer
201 views

From elementary equivalence to isomorphism

A few years ago, when I took the basic course in Logic, I was very surprised to discover that given a signature $\sigma$ and two structures $M$ and $N$ of $\sigma$ which are elementarily equivalent ...
6
votes
0answers
85 views

What classes of complex manifolds are known to be definable in an o-minimal expansion of the real field?

It is a widely known (perhaps slightly folkloric) fact that compact complex manifolds, understood as first-order structures with a predicate for each analytic subset, are definable in an expansion of ...
8
votes
1answer
341 views

Shelah's book on “Classification Theory”

As we know one of the most important and fundamental books in stability, simplicity, forking and ... classification theory, is Shelah's "Classification Theory" where lots of original ideas of the ...
3
votes
3answers
164 views

Turing Functional and $\Sigma_1^0$-formulas in models of fragments of PA

In models of PA with restricted induction power (for example, only $I\Sigma_n$ is present), the failure of higher induction scheme is characterised by the existence of definable cuts (like $\Sigma_2$ ...
11
votes
3answers
554 views

The interplay between certain aspects of interpretability, model theory and category theory

I have some questions about the interplay of interpretability, model theory and category theory. Since I had difficulties in finding literature or other helpful information about this topic, it would ...
6
votes
0answers
159 views

Vaught conjecture for uncountable languages

Recall Vaught conjecture: the number of countable models of a first-order complete theory in a countable language is finite or $\aleph_0$ or $2^{\aleph_0}.$ Now let $\lambda$ be an uncountable ...
5
votes
1answer
175 views

Is the consistency of $\mathcal{L}_{\infty\omega}$-sentences absolute?

The question is exactly that of the title. Suppose $\varphi\in V$ is an $\mathcal{L}_{\infty\omega}$-sentence, and $W$ is an inner model of $V$ such that $\varphi\in W$. Is the statement ...
3
votes
2answers
405 views

Are descriptive and ontological notions of equality equal? [closed]

‎Let ‎$‎‎a$ ‎and ‎‎$‎‎b$ ‎are ‎two "‎objects". ‎What ‎is ‎the ‎meaning ‎of‎ ‎‎$a=b‎‎$‎? This is one of the deepest problems of philosophy and logic because one needs a complete information about ...
9
votes
1answer
297 views

Does existence of a proper class model imply the consistency?

The fundamental theorem of model theory says that: Theorem: A first order theory is consistent if and only if it has a model. In the above theorem we assume that the domain of any model is a ...
5
votes
2answers
255 views

Can we force with Fraisse filters to solve Vaught's conjecture?

Around the classic Fraisse amalgamation theorem in model theory we have the following notions: Definition (1): If $M$ be an $\mathcal{L}$-structure then define: $age(M):=\lbrace N~|~N~\text{is ...
2
votes
0answers
146 views

Is there a non-trivial consistency preserving transformation?

In ‎set ‎theory ‎"equiconsistency" (and not "consistency") ‎of ‎the ‎theories ‎is the‎ ‎main ‎part ‎of ‎researches. ‎So ‎we ‎usually ‎try ‎to ‎construct a‎ ‎new model ‎using a‎ ‎given ‎one. ‎In ‎the ...
13
votes
3answers
709 views

Where is the end of universe?

In some sense the empty set ($\emptyset$) and the global set of all sets ($G$) are the ends of the universe of mathematical objects. The world which $ZFC$ describes has an end from the bottom and is ...
1
vote
0answers
137 views

Relativization of Formulas and Models [closed]

I want to show that the definition of satisfiability is consistent with the definition given by relativization, i.e. Let $L=\{\in\}$. Let $M$ be a definable set and let $E\subset{M\times{M}}$. Let ...
23
votes
4answers
1k views

Illustrating Edward Nelson's Worldview with Nonstandard Models of Arithmetic

Mathematician Edward Nelson is known for his extreme views on the foundations of mathematics, variously described as "ultrafintism" or "strict finitism" (Nelson's preferred term), which came into the ...