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, ...

learn more… | top users | synonyms (1)

20
votes
4answers
2k views

Completion of a category

For a poset $P$ there exists an embedding $y$ into a complete and cocomplet poset $\hat{P}$ of downward closed subsets of $P$. It is easy to verify that the embedding preserves all existing limits and ...
10
votes
3answers
343 views

The continuum hypothesis for packing shapes without overlapping

Consider the finite cross $C$ (=union of line segments $\overline{(0, -1)(0, 1)}$ and $\overline{(-1, 0)(1, 0)}$) and the unit half-circle $H$. It is easy to see that we may pack continuum-many ...
9
votes
3answers
454 views

First-order axiomatization of free groups

Is there a way to axiomatize [non-abelian] free groups in first-order logic using the language of groups (which contains the binary operation symbol $\cdot$, and the constant symbol $e$)? Is there ...
7
votes
1answer
211 views

On $V$-decisive and weakly homogeneous forcings

Suppose that $\Bbb P$ is a forcing in $V$, we say that $\Bbb P$ is $V$-decisive if whenever $\varphi(x_1,\ldots,x_n)$ is a statement in the language of forcing, and $u_1,\ldots,u_n\in V$ then $1_{\Bbb ...
5
votes
1answer
122 views

O-minimal Theories with Non-Dense Order Type

I asked this question on MSE, but I haven't received any comments or responses (also, it has a very low view count), so I thought I would also ask it here. In this paper, Knight, Pillay, and ...
5
votes
0answers
165 views

Canonical functions in set theory and their applications

Given regular cardinal $\kappa>\omega,$ we can define the canonical functions $f_\alpha: \kappa\to \kappa,$ for $\alpha<\kappa^+.$ Some of their properties are presented in Chapter 22 of the ...
4
votes
2answers
263 views

On a modal correspondence

Is there an intuitive characterization of the correspondence for the modal logical formula $\square (\alpha \rightarrow \square \alpha) \rightarrow (\square \alpha \vee \square \lnot \alpha)$? In ...
13
votes
1answer
259 views

Is the regularity of finitely generated rings decidable?

Q: Is there an algorithm to decide whether a given finitely generated (over $\mathbb{Z}$) commutative ring is regular? I mean by regular that the localization at every prime ideal is a regular local ...
-2
votes
0answers
34 views

Demonstrate by extension with 3 changing value [on hold]

I want to demonstrate by extension this : Z x Z U Z It should give some stuff like , {x} element of Z I don't know how to demonstrate by extension because there will be 3 changing values, i, j and ...
25
votes
3answers
1k views

Is it decidable whether or not a collection of integer matrices generates a free group?

Suppose we have integer matrices $A_1,\ldots,A_n\in\operatorname{GL}(n,\mathbb Z)$. Define $\varphi:F_n\to\operatorname{GL}(n,\mathbb Z)$ by $x_i\mapsto A_i$. Is there an algorithm to decide whether ...
0
votes
1answer
97 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: ...
11
votes
4answers
1k views

Is it possible to formulate the axiom of choice as the existence of a survival strategy?

Consider the following situation: There is an infinite set $G$ of giraffes. A lion comes and announces a set $C$ of all possible colours and an infinite cardinal $\kappa$. The hungry lion ...
-4
votes
0answers
88 views

Löwenheim–Skolem as an argument for discrete mathematics? [closed]

At least as far as first-order theories go, one could construe the (downward) Löwenheim–Skolem theorem as an incentive to invest more in discrete models rather than in continuous ones. This would ...
10
votes
2answers
371 views

Is every order type of a PA model the \omega of some ZFC model?

Let $N$ be a model of first-order Peano arithmetic, and let $\sigma$ be its order-type. Does it follow that there is a (non-transitive, expect when $M$ is the standard model) $ZFC$-model $M$ such that ...
7
votes
6answers
1k views

How short can we state the Axiom of Choice?

How short can we state a principle which is equivalent with the Axiom of Choice under $ZF$? The principle should be a sentence in the language of set theory with only $\in$ and$=$ as extralogical ...
44
votes
15answers
11k views

Most 'unintuitive' application of the Axiom of Choice?

It is well-known that the axiom of choice is equivalent to many other assumptions, such as the well-ordering principle, Tychonoff's theorem, and the fact that every vector space has a basis. Even ...
2
votes
2answers
94 views

proof that “small” sets in an extension by iterated forcing already appear in an earlier stage

In Kunen's book (introduction to independence proofs, ) the following lemma is proved (chapter 8, lemma 5.14): Assume that in M, $\alpha$ is a limit ordinal, $( ( \mathbb{P}_\xi : \xi \leq \alpha) , ...
5
votes
1answer
172 views

Consistency of Weak Diamond with a Weak Version of Martin's Axiom

If $S \subset \omega_1$ is stationary, then the weak diamond principle $\Phi(S)$ states that for any $F: 2^{<\omega_1} \to 2$, there is a $g: \omega_1 \to 2$ such that for all $f: \omega_1 \to 2$, ...
9
votes
4answers
457 views

Boolean Valued Models of PA

O.K, a massively naive question. I've never really studied any non-standard models of PA before. I was just wondering if there's ever been any attempt to use the kind of Boolean valued model theory ...
3
votes
1answer
190 views

How to change the successor of a singular with a Woodin?

I'm looking for references on how to change the successor of a singular cardinal from "more or less" minimal assumptions. If possible, then without adding bounded subsets to the singular either. In ...
4
votes
1answer
284 views

Forcing is intuitionistic

The main idea of why it´s necessary a generic filter $G$ to extend a countable transitive $\epsilon$-interpretation (not necessarily a model) $M$ is given by the condition (for which $G$ being a ...
-1
votes
3answers
161 views

About “absolute proof” of Arithmetic consistency [closed]

Ok so as Godel's theorems states, you cant prove that Peano arithmetic is consistent by using only the axioms within Peano model. You need to use axioms or rules of inferations beyond the model you ...
-2
votes
1answer
243 views

What is the Shortest Axiom of Classical Conditional-Negation Propositional Calculus? [closed]

Suppose that we only have propositional variables and connectives. Suppose our rules of inference are detachment {C$\alpha$$\beta$, $\alpha$} $\vdash$ $\beta$, and uniform substitution. Suppose that ...
0
votes
1answer
94 views

Models of BL$\forall$

What results are known about the construction of models for a theory $T$ of the logic BL$\forall$ for languages of higher cardinality? The construction for the countable case relies on 1) The fact ...
9
votes
1answer
297 views

Sets computable from enough hints

Is there a non-computable set $X\subset\omega$ such that, for some $Y\subset\omega$, any infinite subset or cosubset (=subset of the complement) of $Y$ computes $X$? More generally, call a set $X$ ...
6
votes
1answer
324 views

Groups and pregeometries

Definition. For an infinite structure $\mathcal{A}$ and $cl : P(dom(\mathcal{A})) \longrightarrow P(dom(\mathcal{A}))$ , we say that $(\mathcal{A}, cl)$ is a structure carrying an $\omega$-homogeneous ...
5
votes
2answers
374 views

complexity of proof of p(n) grows greater with n if for all x P(x) is unprovable?

Is it true that if "for all x P(x)" is unprovable in pA then the complexity of the proof of P(n) becomes greater as n grows bigger?
1
vote
2answers
222 views

An interpretation of not-Con(PA)

Edit After Andreas Blass answer below and comments below the original post I have changed it to accommodate posters' remarks. I hope it is clear and makes more sense now. Let $\mathrm{PA}$ be the ...
3
votes
1answer
202 views

On fast-growing hierarchy

Is there exists a recursively enumerable set of computable total fast-growing functions $(\mathbb N \rightarrow \mathbb N)$ such, that this set has no upper boundary in the set of all such functions ...
61
votes
16answers
5k views

When are two proofs of the same theorem really different proofs

Many well-known theorems have lots of "different" proofs. Often new proofs of a theorem arise surprisingly from other branches of mathematics than the theorem itself. When are two proofs really the ...
4
votes
1answer
367 views

Why is adopting Russell's Axiom of Reducibility as strong as eliminating the Ramified Hierarchy?

In order to respond to concerns of impredicativity, Bertrand Russell developed a system of ramified second-order logic, which is like regular second-order logic except the comprehension schema is ...
1
vote
0answers
71 views

Real algebraic groups and pseudo-finiteness

What is the relationship between pseudo-finite groups and real algebraic groups? Could you provide an example of a pseudo-finite real algebraic group and of a non pseudo-finite one, if any? Thank ...
10
votes
1answer
265 views

Reverse mathematics of meromorphic functions on Riemann surfaces

Various sources touch briefly on the reverse mathematics of measure theory and complex analysis. But I have found none on the uniformization theorem for Riemann surfaces or the existence of ...
4
votes
1answer
175 views

If questions are formalized as ideals of a boolean algebra, what kind of algebra of questions appears from Stone representation theorem?

Affirmative propositions make up a Boolean algebra, and Boolean algebras became part of classical algebra for over one century ago - in this sense they are "simple". But I did not encounter in ...
7
votes
1answer
595 views

Can formal logic give a precise notion of “canonical”?

Coming off of this discussion, I'm wondering what the term "canonical" really means. In that thread, many suggested category theory as a way to formalize the concept of what "canonical" means, using ...
58
votes
9answers
4k views

Can we unify addition and multiplication into one binary operation? To what extent can we find universal binary operations?

The question is the extent to which we can unify addition and multiplication, realizing them as terms in a single underlying binary operation. I have a number of questions. Is there a binary ...
1
vote
1answer
172 views

Bodnarchuk, Kaluzhnin, Kotov, Romov’s Theorem on inclusion of Polymorphism ($Pol \rho \subseteq Pol \sigma$)

Bodnarchuk, Kaluzhnin, Kotov, Romov’s paper [1] is well-known. Anne Fearnley [2] infered from it the following theroem and used it to prove the inclusion of polymorphisms. Theorem (Bodnarchuk, ...
2
votes
1answer
401 views

Is this system incomplete?

Let $\mathbf{SBM}$ be the normal modal logic system defined as $\mathbf{T}$ plus the following two axioms: $$\mathrm{SB}: \Box(\Diamond p \rightarrow p)\rightarrow (p \rightarrow \Box p)$$ ...
5
votes
2answers
255 views

When are all greater cardinals sharply greater?

Makkai and Paré introduced the following binary relation on regular cardinals: given $\kappa$ and $\lambda$, $\kappa \vartriangleleft \lambda$ (read, $\kappa$ is sharply less than $\lambda$) when ...
7
votes
1answer
231 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 ...
6
votes
1answer
246 views

higher-order reflection

In the first-order context, "reflection" of a formula $\varphi(x)$ below $\kappa$ refers to the the following situation: There are many ordinals $\alpha<\kappa$ such that for all $a \in ...
10
votes
1answer
523 views

“cov vs pp” problem

This is the problem $(\beta)$ of the section 14.7 in the "Analytical Guide" of the Shelah's book "Cardinal Arithmetic": $(\beta)$ Is $\operatorname{cov} ( \lambda , \lambda, \aleph_{1} , 2) =^{+} ...
5
votes
1answer
357 views

Can $V\neq\text{HOD}$ if every $\Sigma_2$-definable set has an ordinal-definable element?

This question arises from an issue arising in user38200's recent question concerning models of set theory in which every definable set has a definable element. In my answer to that question, with ...
50
votes
3answers
6k views

Nelson's program to show inconsistency of ZF

At the end of the paper Division by three by Peter G. Doyle and John H. Conway, the authors say: Not that we believe there really are any such things as infinite sets, or that the Zermelo-Fraenkel ...
12
votes
5answers
1k views

Deduction theorem

Is there an axiomatic system where the deduction theorem does not hold?
27
votes
7answers
5k views

Status of Harvey Friedman's grand conjecture?

Friedman [1] conjectured Every theorem published in the Annals of Mathematics whose statement involves only finitary mathematical objects (i.e., what logicians call an arithmetical statement) ...
6
votes
8answers
2k views

ULTRAINFINITISM, or a step beyond the transfinite

Cantor has, in the immortal words of D. Hilbert, given all of us a paradise (or perhaps, I would rather say, a great vacation spot), the TRANSFINITE. $\aleph_0, \aleph_1,\aleph_2\dots$ the lists ...
12
votes
0answers
730 views

Hrushovski's Construction

Zilber expressed a conjecture for $\aleph_{1}$- categorical theories (In the 80s). Zilber's Conjecture: The geometry of any $\aleph_{1}$- categorical structure is one of the following: (a) Trivial ...
8
votes
2answers
603 views

Are there standard examples of stable theories that are undecidable?

What is known about decidability of various first order theories studied in stable model theory, geometric model theory, o-minimality? For example, is there a natural example of an undecidable ...
3
votes
1answer
254 views

A totally categorical structure with trivial geometry which is not interpretable in the trivial structure

Among the theorems of early geometric model theory there is one by Lachlan stating that every totally categorical structure with a trivial pregeometry is intrepretable in a dense linear order. That ...