Pages that link to "Non-standard model of arithmetic"
Appearance
Showing 250 items.
- Axiom of choice (links | edit)
- Axiom (links | edit)
- Kolmogorov complexity (links | edit)
- Automated theorem proving (links | edit)
- Bijection (links | edit)
- Binary operation (links | edit)
- Naive set theory (links | edit)
- Continuum hypothesis (links | edit)
- Countable set (links | edit)
- Cardinal number (links | edit)
- Cardinality (links | edit)
- Church–Turing thesis (links | edit)
- Logical disjunction (links | edit)
- Decision problem (links | edit)
- Equivalence relation (links | edit)
- Empty set (links | edit)
- Entscheidungsproblem (links | edit)
- Formal language (links | edit)
- First-order logic (links | edit)
- Finite set (links | edit)
- Gödel's completeness theorem (links | edit)
- Law of noncontradiction (links | edit)
- Law of excluded middle (links | edit)
- Logical conjunction (links | edit)
- Logical connective (links | edit)
- Propositional calculus (links | edit)
- Lambda calculus (links | edit)
- Lemma (mathematics) (links | edit)
- Mathematical induction (links | edit)
- Finitary relation (links | edit)
- Mathematical logic (links | edit)
- Model theory (links | edit)
- Class (set theory) (links | edit)
- Natural number (links | edit)
- NP (complexity) (links | edit)
- Ordered pair (links | edit)
- Power set (links | edit)
- Principia Mathematica (links | edit)
- Primitive recursive function (links | edit)
- Peano axioms (links | edit)
- Recursion (links | edit)
- Proof by contradiction (links | edit)
- Set (mathematics) (links | edit)
- Soundness (links | edit)
- Set theory (links | edit)
- Subset (links | edit)
- Surjective function (links | edit)
- Turing machine (links | edit)
- Transfinite induction (links | edit)
- Theorem (links | edit)
- Uncountable set (links | edit)
- Type theory (links | edit)
- Arity (links | edit)
- Injective function (links | edit)
- Russell's paradox (links | edit)
- Philosophy of mathematics (links | edit)
- Union (set theory) (links | edit)
- Syllogism (links | edit)
- Domain of a function (links | edit)
- Codomain (links | edit)
- Natural deduction (links | edit)
- Cantor's diagonal argument (links | edit)
- Zorn's lemma (links | edit)
- Complement (set theory) (links | edit)
- Classical logic (links | edit)
- Gödel's incompleteness theorems (links | edit)
- Venn diagram (links | edit)
- Consistency (links | edit)
- Contradiction (links | edit)
- Universal quantification (links | edit)
- Mathematical proof (links | edit)
- Equality (mathematics) (links | edit)
- Existential quantification (links | edit)
- Richard's paradox (links | edit)
- Infinite set (links | edit)
- Goodstein's theorem (links | edit)
- Compactness theorem (links | edit)
- Zermelo–Fraenkel set theory (links | edit)
- Hilbert's second problem (links | edit)
- Computability theory (links | edit)
- Negation (links | edit)
- Truth value (links | edit)
- Logical equivalence (links | edit)
- Foundations of mathematics (links | edit)
- Functional predicate (links | edit)
- Proof theory (links | edit)
- König's theorem (set theory) (links | edit)
- Axiomatic system (links | edit)
- Quadratic residue (links | edit)
- Gödel numbering (links | edit)
- Structural induction (links | edit)
- Enumeration (links | edit)
- Open formula (links | edit)
- Logical biconditional (links | edit)
- Square of opposition (links | edit)
- Inaccessible cardinal (links | edit)
- Three-valued logic (links | edit)
- Rule of inference (links | edit)
- List of mathematical proofs (links | edit)
- Ultraproduct (links | edit)
- Range of a function (links | edit)
- Uniqueness quantification (links | edit)
- Predicate (mathematical logic) (links | edit)
- Aleph number (links | edit)
- Extensionality (links | edit)
- Universe (mathematics) (links | edit)
- Universal set (links | edit)
- Supertask (links | edit)
- Well-founded relation (links | edit)
- Tarski's theorem about choice (links | edit)
- Term logic (links | edit)
- Reverse mathematics (links | edit)
- Computably enumerable set (links | edit)
- Computable set (links | edit)
- Second-order logic (links | edit)
- Cantor's theorem (links | edit)
- Löwenheim–Skolem theorem (links | edit)
- Constructible universe (links | edit)
- List of mathematical logic topics (links | edit)
- Logicism (links | edit)
- Proof by infinite descent (links | edit)
- Proof by exhaustion (links | edit)
- Semiring (links | edit)
- Cardinal assignment (links | edit)
- Von Neumann cardinal assignment (links | edit)
- Regular cardinal (links | edit)
- Successor cardinal (links | edit)
- Large cardinal (links | edit)
- Formal system (links | edit)
- Metalanguage (links | edit)
- Well-formed formula (links | edit)
- Von Neumann universe (links | edit)
- Thoralf Skolem (links | edit)
- Superseded theories in science and results in mathematics (links | edit)
- Map (mathematics) (links | edit)
- Von Neumann–Bernays–Gödel set theory (links | edit)
- Saturated model (links | edit)
- Syntax (logic) (links | edit)
- Higher-order logic (links | edit)
- Stratification (mathematics) (links | edit)
- Tarski's undefinability theorem (links | edit)
- Semantic theory of truth (links | edit)
- Nonfirstorderizability (links | edit)
- Expression (mathematics) (links | edit)
- Transfer principle (links | edit)
- Urelement (links | edit)
- Material conditional (links | edit)
- Element (mathematics) (links | edit)
- List of statements independent of ZFC (links | edit)
- Axiom of constructibility (links | edit)
- Boolean function (links | edit)
- Axiom schema (links | edit)
- Setoid (links | edit)
- Hilbert's axioms (links | edit)
- Semantics of logic (links | edit)
- Proof-theoretic semantics (links | edit)
- Decidability (logic) (links | edit)
- Atomic sentence (links | edit)
- New Foundations (links | edit)
- Algebra of sets (links | edit)
- Elementary equivalence (links | edit)
- Self-verifying theories (links | edit)
- Predicate variable (links | edit)
- T-schema (links | edit)
- Grothendieck universe (links | edit)
- Non-well-founded set theory (links | edit)
- Categorical theory (links | edit)
- Kripke–Platek set theory (links | edit)
- Computable function (links | edit)
- Independence (mathematical logic) (links | edit)
- Formal proof (links | edit)
- Mostowski collapse lemma (links | edit)
- Skolem's paradox (links | edit)
- Martin's axiom (links | edit)
- Propositional variable (links | edit)
- Propositional formula (links | edit)
- Free logic (links | edit)
- Prime model (links | edit)
- Fodor's lemma (links | edit)
- Diagonal intersection (links | edit)
- Club filter (links | edit)
- Finite model theory (links | edit)
- Mathematical structure (links | edit)
- Conservative extension (links | edit)
- Ground expression (links | edit)
- Back-and-forth method (links | edit)
- Substructure (mathematics) (links | edit)
- Extension by new constant and function names (links | edit)
- Sentence (mathematical logic) (links | edit)
- Truth-value semantics (links | edit)
- Tarski's axioms (links | edit)
- Generic filter (links | edit)
- Transitive set (links | edit)
- Epsilon-induction (links | edit)
- Robinson arithmetic (links | edit)
- Morse–Kelley set theory (links | edit)
- Cantor's paradox (links | edit)
- Computer-assisted proof (links | edit)
- Church encoding (links | edit)
- Atomic model (mathematical logic) (links | edit)
- Logical equality (links | edit)
- Equiconsistency (links | edit)
- Implementation of mathematics in set theory (links | edit)
- Theory (mathematical logic) (links | edit)
- List of first-order theories (links | edit)
- Proof of impossibility (links | edit)
- Variable (mathematics) (links | edit)
- Turing's proof (links | edit)
- Type (model theory) (links | edit)
- Spectrum of a theory (links | edit)
- Hereditary set (links | edit)
- Logical truth (links | edit)
- Course-of-values recursion (links | edit)
- Structure (mathematical logic) (links | edit)
- Ω-consistent theory (links | edit)
- Gentzen's consistency proof (links | edit)
- Logical constant (links | edit)
- Alphabet (formal languages) (links | edit)
- Atomic formula (links | edit)
- Tautology (logic) (links | edit)
- Order type (links | edit)
- Truth predicate (links | edit)
- Constructive set theory (links | edit)
- Satisfiability modulo theories (links | edit)
- Functional completeness (links | edit)
- Axiom of global choice (links | edit)
- Substitution (logic) (links | edit)
- Inhabited set (links | edit)
- Tarski–Grothendieck set theory (links | edit)
- Non-standard model of arithmetic (transclusion) (links | edit)
- Nonstandard arithmetic (redirect page) (links | edit)
- Nonstandard number theory (redirect page) (links | edit)
- Non-standard number theory (redirect page) (links | edit)
- Primitive recursive arithmetic (links | edit)
- Lindström's theorem (links | edit)
- Signature (logic) (links | edit)
- Non-logical symbol (links | edit)
- Ross–Littlewood paradox (links | edit)
- Apartness relation (links | edit)
- Weakly o-minimal structure (links | edit)
- Institutional model theory (links | edit)
- Monadic predicate calculus (links | edit)
- Axiomatic system (logic) (links | edit)
- Contraposition (links | edit)
- Aczel's anti-foundation axiom (links | edit)
- Proof sketch for Gödel's first incompleteness theorem (links | edit)
- Elementary proof (links | edit)
- General set theory (links | edit)
- Complete theory (links | edit)
- Paradoxes of set theory (links | edit)