Proof in Alonzo Church's and Alan Turing's Mathematical Logic: Undecidability of First Order LogicUniversal-Publishers |
Continguts
LITERATURE REVIEW | 16 |
BACKGROUND TO PROOF THEORY DECISION | 63 |
UNDECIDABILITY OF FIRSTORDERLOGIC | 122 |
Firstorder Logic 135 | 135 |
GENERAL ASSESSMENT RECOMMENDATION | 148 |
Altres edicions - Mostra-ho tot
Proof in Alonzo Church's and Alan Turing's Mathematical Logic ... Jonathan O. Chimakonam Previsualització no disponible - 2012 |
Proof in Alonzo Church's and Alan Turing's Mathematical Logic ... Jonathan O. Chimakonam Previsualització no disponible - 2012 |
Frases i termes més freqüents
Alan Turing algorithm Alonzo Church assemblage axiom systems axiomatic called Cantor’s chapter Church-Turing thesis complete concepts consistency proof construct continuum hypothesis David Hilbert decision problem derivation determining dissertation effective method effectively calculable Effectively Provable Functions Entscheidungsproblem equivalent expressed Feferman finitary finite number finitistic first-order logic first-order-logic formal system formulae foundations Frege functional calculus Gentzen given halting problem hence input integers intuitionistic Kant’s Kurt Gödel language logical system logicians mathematical logic mathematical problems mathematical proofs mathematicians means negative solution notion order logic ordinal P-machine paper Peano arithmetic philosophy of mathematics positive solution predicate calculus Principia Mathematica problems numbered proof of consistency proof system proof theory propositional logic proved quantifiers question real numbers reasoning recursive result rules sense sentence sequence set theory solvable solving the decision symbol space symbolic logic system of logic Tarski transfinite true truth Turing machine Turing’s undecidable values