Question

ZFC-Infinity+PA: Does it prove Con(PA)?

score 138 · Answer 1 · 2026-03-25 06:09:50

138

Views

ZFC-Infinity+PA: Does it prove Con(PA)?

Published on 25 Mar 2026 - 6:09

score 323 · Answer 2 · 2018-05-29 00:17:50

323

Views

Can Peano arithmetic prove 0=1 in a standard number of steps (in a non-standard model)?

Published on 29 May 2018 - 0:17

score 527 · Answer 3 · 2026-03-25 01:28:04

527

Views

How can we be so sure that we don't live in Pudlak's inconsistent world?

Published on 25 Mar 2026 - 1:28

score 118 · Answer 4 · 2026-03-24 22:45:50

118

Views

Understanding interpretation of quantified set variables in Herbert Enderton "Second-order and Higher-order logic"

Published on 24 Mar 2026 - 22:45

score 181 · Answer 5 · 2026-03-25 01:27:00

181

Views

Can two different models of arithmetic have non-comparable views of peano arithmetic?

Published on 25 Mar 2026 - 1:27

score 48 · Answer 6 · 2018-06-01 00:28:31

48

Views

Embeddings imply isomorphism

Published on 01 Jun 2018 - 0:28

score 73 · Answer 7 · 2018-06-02 19:10:23

73

Views

proving/disproving basic logical claims

Published on 02 Jun 2018 - 19:10

score 142 · Answer 8 · 2018-06-02 20:57:26

142

Views

Primality is not existential over true arithmetic

Published on 02 Jun 2018 - 20:57

score 100 · Answer 9 · 2018-06-06 21:27:19

100

Views

Can bounded addition and multiplication be computable in a non-standard model of arithmetic?

Published on 06 Jun 2018 - 21:27

score 361 · Answer 10 · 2018-06-10 18:23:35

361

Views

Proving $y = x + 1$ doesn't have a quantifier-free formula in $(\mathbb{Z}, =, <)$

Published on 10 Jun 2018 - 18:23

score 130 · Answer 11 · 2018-06-12 15:33:51

130

Views

Can we add a ordinal bigger than every other ordinal and end up with a transitive model?

Published on 12 Jun 2018 - 15:33

score 850 · Answer 12 · 2018-06-13 15:28:59

850

Views

Monster Model Theory

Published on 13 Jun 2018 - 15:28

score 302 · Answer 13 · 2018-06-13 18:30:08

302

Views

products and coproducts in the category of all categories

Published on 13 Jun 2018 - 18:30

score 273 · Answer 14 · 2026-03-24 12:27:38

273

Views

A axiomatization of (full) Second Order Logic with a decidable proof system cannot be complete; is this true if we only require semi-decidability?

Published on 24 Mar 2026 - 12:27

score 465 · Answer 15 · 2018-06-17 12:54:00

465

Views

If every finite subset of a theory has an infinite model then the theory has an infinite model

Published on 17 Jun 2018 - 12:54

List Question

ZFC-Infinity+PA: Does it prove Con(PA)?

Can Peano arithmetic prove 0=1 in a standard number of steps (in a non-standard model)?

How can we be so sure that we don't live in Pudlak's inconsistent world?

Understanding interpretation of quantified set variables in Herbert Enderton "Second-order and Higher-order logic"

Can two different models of arithmetic have non-comparable views of peano arithmetic?

Embeddings imply isomorphism

proving/disproving basic logical claims

Primality is not existential over true arithmetic

Can bounded addition and multiplication be computable in a non-standard model of arithmetic?

Proving $y = x + 1$ doesn't have a quantifier-free formula in $(\mathbb{Z}, =, <)$

Can we add a ordinal bigger than every other ordinal and end up with a transitive model?

Monster Model Theory

products and coproducts in the category of all categories

A axiomatization of (full) Second Order Logic with a decidable proof system cannot be complete; is this true if we only require semi-decidability?

If every finite subset of a theory has an infinite model then the theory has an infinite model

Trending Questions

Popular # Hahtags

Popular Questions