<--- Back to Details
First PageDocument Content
Proof theory / Model theory / Computability theory / Predicate logic / First-order logic / Peano axioms / Arithmetical hierarchy / Constructible universe / Bounded quantifier / Mathematical logic / Logic / Mathematics
Date: 2002-01-14 17:15:00
Proof theory
Model theory
Computability theory
Predicate logic
First-order logic
Peano axioms
Arithmetical hierarchy
Constructible universe
Bounded quantifier
Mathematical logic
Logic
Mathematics

Add to Reading List

Source URL: www.math.ucsd.edu

Download Document from Source Website

File Size: 652,13 KB

Share Document on Facebook

Similar Documents

Logic / Mathematical logic / Abstraction / Predicate logic / Finite model theory / Quantification / FO / Quantifier / Constructible universe

An optimal Gaifman normal form construction for structures of bounded degree Lucas Heimberg1 Dietrich Kuske2

DocID: 1jAj3 - View Document

Mathematical logic / Theory of computation / Computable number / Computable function / Bounded quantifier / Computable real function / Function / Oracle machine / Decision problem / Computability theory / Theoretical computer science / Mathematics

arXiv:1204.6671v1 [cs.LO] 30 Apr 2012 δ-Decidability over the Reals∗ Sicun Gao, Jeremy Avigad, and Edmund M. Clarke Carnegie Mellon University, Pittsburgh, PAMay 1, 2012

DocID: 18Kz4 - View Document

Proof theory / Model theory / Computability theory / Predicate logic / First-order logic / Peano axioms / Arithmetical hierarchy / Constructible universe / Bounded quantifier / Mathematical logic / Logic / Mathematics

PDF Document

DocID: 1jT3 - View Document

Proof theory / Ordinal numbers / Constructible universe / Peano axioms / Ordinal analysis / Function / Bounded quantifier / New Foundations / Surreal number / Mathematical logic / Mathematics / Logic

PDF Document

DocID: 16Yn - View Document