Question

Are there any consistency proofs for propositional or first-order logic?

score 621 · Answer 1 · 2015-06-09 09:30:16

621

Views

Are there any consistency proofs for propositional or first-order logic?

Published on 09 Jun 2015 - 9:30

score 131 · Answer 2 · 2026-04-11 09:38:54

131

Views

Finite fields properties

Published on 11 Apr 2026 - 9:38

score 699 · Answer 3 · 2026-04-10 21:52:14

699

Views

First order definition of $\pi$

Published on 10 Apr 2026 - 21:52

score 346 · Answer 4 · 2026-04-11 20:53:39

346

Views

Help with this explanation of the Material Conditional

Published on 11 Apr 2026 - 20:53

score 440 · Answer 5 · 2026-04-11 01:22:14

440

Views

Satisfiability of sentences (Compactness theorem)

Published on 11 Apr 2026 - 1:22

score 196 · Answer 6 · 2026-03-26 14:42:57

196

Views

Encyclopedia of Mathematical Proofs with no English

Published on 26 Mar 2026 - 14:42

score 90 · Answer 7 · 2026-04-12 09:15:17

90

Views

Can $(\forall x) xE0=S0$ be one of axioms for a theory of arithmetic?

Published on 12 Apr 2026 - 9:15

score 61 · Answer 8 · 2015-06-15 11:07:53

61

Views

Prove that class of models isomorphic to some infinite model $M$ is not countably axiomatizable

Published on 15 Jun 2015 - 11:07

score 90 · Answer 9 · 2015-06-15 13:37:42

90

Views

Prove that the class of non-standard models of arithmetics is not axiomatizable

Published on 15 Jun 2015 - 13:37

score 231 · Answer 10 · 2015-06-17 23:11:59

231

Views

Proof that an property is definable if and only if its axiomatiazable and its complement its axiomatizable

Published on 17 Jun 2015 - 23:11

score 111 · Answer 11 · 2015-06-18 13:19:11

111

Views

If a theory over a vocabulary $L$ has a model with countable domain, then it has a model with uncountable domain

Published on 18 Jun 2015 - 13:19

score 105 · Answer 12 · 2015-06-19 15:09:10

Proof that given an empty vocabulary, P = { $\Omega$ $\in$ STRUCT[L] | $\Omega$ has domain countable and infinity} is not definable.

score 43 · Answer 13 · 2026-04-13 03:21:45

43

Views

Finding a morphism from one boolean expression to another i.e. $\phi :(x \Rightarrow y) \rightarrow (y \vee z)$

Published on 13 Apr 2026 - 3:21

score 823 · Answer 14 · 2026-04-13 05:08:46

823

Views

Introduction to Symbolic Logic: 'Understanding Symbolic Logic, 2nd Edition,' by Virginia Klenk, Page 294

Published on 13 Apr 2026 - 5:08

score 123 · Answer 15 · 2026-04-12 18:42:32

123

Views

If the canonical embedding is an isomorphism then U is a principal ultrafilter

Published on 12 Apr 2026 - 18:42

List Question

Are there any consistency proofs for propositional or first-order logic?

Finite fields properties

First order definition of $\pi$

Help with this explanation of the Material Conditional

Satisfiability of sentences (Compactness theorem)

Encyclopedia of Mathematical Proofs with no English

Can $(\forall x) xE0=S0$ be one of axioms for a theory of arithmetic?

Prove that class of models isomorphic to some infinite model $M$ is not countably axiomatizable

Prove that the class of non-standard models of arithmetics is not axiomatizable

Proof that an property is definable if and only if its axiomatiazable and its complement its axiomatizable

If a theory over a vocabulary $L$ has a model with countable domain, then it has a model with uncountable domain

Proof that given an empty vocabulary, P = { $\Omega$ $\in$ STRUCT[L] | $\Omega$ has domain countable and infinity} is not definable.

Finding a morphism from one boolean expression to another i.e. $\phi :(x \Rightarrow y) \rightarrow (y \vee z)$

Introduction to Symbolic Logic: 'Understanding Symbolic Logic, 2nd Edition,' by Virginia Klenk, Page 294

If the canonical embedding is an isomorphism then U is a principal ultrafilter

Trending Questions

Popular # Hahtags

Popular Questions