# Tagged Questions

first-order and higher-order logic, model theory, set theory, proof theory, computability theory, formal languages, definability, interplay of syntax and semantics, constructive logic, intuitionism, philosophical logic, modal logic, completeness, Gödel incompleteness, decidability, undecidability, ...

96 views

### Cohen's model yet again

It has been discussed already whether a countable OD set necessarily contains an OD element. See e.g. A question about ordinal definable real numbers . A negative answer was obtained in Archive for ...
278 views

### Normal subgroups of Aut(M)

Let $S$ be the set of all finite permutations of $\mathbb{N}$, i.e. they fix all but a finite set, and $A\subset S$ the set of all even permutations. Theorem The normal subgroups of $S_\infty$ are ...
49 views

### Is ∃x.px=>q equal to ∃x.(px=>q)? [on hold]

I wondered if the sentences ∃x.px=>q equal to ∃x.(px=>q). I think they are equal because of the following example: The instance of the first sentence: If there exist a cow, then it ...
129 views

### Number of distinct variables used in axiomatizating (Classical) Propositional Logic

The first part of the present question is concerned with Classical Propositional Logic (CPL). The second part involves its fragments or alternative logical systems. There are in the literature many ...
189 views

### Tree property using side conditions

The following problems were asked during the high and low forcing workshop: Question 1. Can one force tree property at $\kappa^{++}$ for $\kappa$ singular using side conditions? Question 2. ...
67 views

### (∀x.(p(x)⇒∀x.p(x)) )= ((∃x.p(x))⇒(∀y.p(y)))? [closed]

In dealing with my homeowrk, someone has told me ∀x.(p(x)⇒∀x.p(x)) could be transformed to (∃x.p(x))⇒(∀y.p(y)) However, intuitively, this doesn't make sense to me, could anyone give me a ...
77 views

### Semi-algebraicness of cells involved in integrals of semi-algebraic functions

Background: In "Stability under integration of sums of products of real globally subanalytic functions and their logarithms", by R. Cluckers and D.J. Miller, it is shown that the integral of a ...
208 views

### Uncountable models of Kelley-Morse set theory with only a countable number of sets

The Kelley-Morse set theory can be thought as the "full-secondorderification of $\sf ZFC$", where we switch from sets to classes and allow the comprehension schema to include quantifiers on class ...
222 views

### Unbounded towers and combinatorial cardinal characteristics of the continuum

Update: Perhaps the question is too difficult. I would appreciate, thus, even just comments or related observations. This question assumes familiarity with combinatorial cardinal characteristics of ...
320 views

### Forcing PFA with ccc forcing

Is it consistent (from suitable large cardinals) that there is a ccc poset which forces PFA? This seems quite implausible to me. If we could force PFA via ccc forcing, the ground model would have to ...
278 views

### Why do we need a transitive model in forcing arguments?

One major approach to the theory of forcing is to assume that ZFC has a countable transitive model $M \in V$ (where $V$ is the "real" universe). In this approach, one takes a poset $\mathbb{P} \in M$, ...
98 views

### Choice and the Baire property in non-separable complete metric spaces

It's known to be consistent with ZF+DC that every subset of $\mathbb{R}$ has the Baire property (BP). (E.g. Shelah's model). If so, then every subset of every complete separable metric space has ...
356 views

### Consistent sentences with no arithmetically definable models

I've seen a construction of a sentence of first order logic that is consistent, but has no models with underlying set $\mathbb{N}$ and recursive functions and relations. Do there also exist consistent ...
275 views

154 views

218 views

### A kind of saturation property related to forcing notions

Forcing is typically done over well-founded models. There are lots of good reasons for this, but it can feel confining at times. Fortunately, we can equally well force over non-well-founded models! It ...
597 views

5k views

### The best text to study both incompleteness theorems

Hi! What text on both incompleteness theorems you would recommend for beginner? Specifically, I'm looking for the text with the following properties: 1) The proofs should be finitistic, in Godel's ...