About: Systems of Logic Based on Ordinals

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Systems of Logic Based on Ordinals Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatSystemsOfFormalLogic, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSystems_of_Logic_Based_on_Ordinals

Systems of Logic Based on Ordinals was the PhD dissertation of the mathematician Alan Turing. Turing's thesis is not about a new type of formal logic, nor was he interested in so-called ‘ranked logic’ systems derived from ordinal or relative numbering, in which comparisons can be made between truth-states on the basis of relative veracity. Instead, Turing investigated the possibility of resolving the Godelian incompleteness condition using Cantor's method of infinites. This condition can be stated thus—in all systems with finite sets of axioms, an exclusive-or condition applies to expressive power and provability; i.e. one can have power and no proof, or proof and no power, but not both.

Attributes	Values
rdf:type	yago:WikicatOrdinalNumbers yago:Ability105616246 yago:Abstraction100002137 yago:Cognition100023271 yago:DefiniteQuantity113576101 yago:Know-how105616786 yago:Logic105664069 yago:Measure100033615 yago:Method105660268 yago:Number113582013 yago:OrdinalNumber113597280 yago:PsychologicalFeature100023100 book yago:System105661996 yago:WikicatSystemsOfFormalLogic
rdfs:label	Systems of Logic Based on Ordinals (en)
rdfs:comment	Systems of Logic Based on Ordinals was the PhD dissertation of the mathematician Alan Turing. Turing's thesis is not about a new type of formal logic, nor was he interested in so-called ‘ranked logic’ systems derived from ordinal or relative numbering, in which comparisons can be made between truth-states on the basis of relative veracity. Instead, Turing investigated the possibility of resolving the Godelian incompleteness condition using Cantor's method of infinites. This condition can be stated thus—in all systems with finite sets of axioms, an exclusive-or condition applies to expressive power and provability; i.e. one can have power and no proof, or proof and no power, but not both. (en)
dcterms:subject	History of logic Systems of formal logic Mathematics papers Ordinal numbers Alan Turing
Wikipage page ID	32122937 (xsd:integer)
Wikipage revision ID	1102769395 (xsd:integer)
Link from a Wikipage to another Wikipage	Transfinite induction Oracle machine Georg Cantor Theoretical computer science Mathematician History of logic Alan Turing Alonzo Church Systems of formal logic Gödel's incompleteness theorems Mathematics papers Ordinal numbers Alan Turing Martin Davis (mathematician) Kurt Gödel Ordinal number Ordinal logic Polynomial time hierarchy
Link from a Wikipage to an external page	https://web.archive.org/web/20121023103503/https:/webspace.princeton.edu/users/jedwards/Turing%20Centennial%202012/Mudd%20Archive%20files/12285_AC100_Turing_1938.pdf https://rauterberg.employee.id.tue.nl/lecturenotes/DDM110%20CAS/Turing/Turing-1939%20Sysyems%20of%20logic%20based%20on%20ordinals.pdf https://www.dcc.fc.up.pt/~acm/turing-phd.pdf http://www.princeton.edu/turing/alan/dissertation/ http://math.stanford.edu/~feferman/papers/turingnotices.pdf
sameAs	Systems of Logic Based on Ordinals Systems of Logic Based on Ordinals Systems of Logic Based on Ordinals Systems of Logic Based on Ordinals
dbp:wikiPageUsesTemplate	dbt:Mathematics-lit-stub dbt:Citation dbt:Cite_web dbt:Reflist dbt:Short_description dbt:Mathlogic-stub
has abstract	Systems of Logic Based on Ordinals was the PhD dissertation of the mathematician Alan Turing. Turing's thesis is not about a new type of formal logic, nor was he interested in so-called ‘ranked logic’ systems derived from ordinal or relative numbering, in which comparisons can be made between truth-states on the basis of relative veracity. Instead, Turing investigated the possibility of resolving the Godelian incompleteness condition using Cantor's method of infinites. This condition can be stated thus—in all systems with finite sets of axioms, an exclusive-or condition applies to expressive power and provability; i.e. one can have power and no proof, or proof and no power, but not both. The thesis is an exploration of formal mathematical systems after Gödel's theorem. Gödel showed for that any formal system S powerful enough to represent arithmetic, there is a theorem G which is true but the system is unable to prove. G could be added as an additional axiom to the system in place of a proof. However this would create a new system S' with its own unprovable true theorem G', and so on. Turing's thesis looks at what happens if you simply iterate this process repeatedly, generating an infinite set of new axioms to add to the original theory, and even goes one step further in using transfinite recursion to go "past infinity," yielding a set of new theories Gn, one for each ordinal number n. The thesis was completed at Princeton under Alonzo Church and was a classic work in mathematics which introduced the concept of ordinal logic. Martin Davis states that although Turing's use of a computing oracle is not a major focus of the dissertation, it has proven to be highly influential in theoretical computer science, e.g. in the polynomial time hierarchy. (en)
gold:hypernym	Dissertation
prov:wasDerivedFrom	wikipedia-en:Systems_of_Logic_Based_on_Ordinals?oldid=1102769395&ns=0
page length (characters) of wiki page	4276 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Systems_of_Logic_Based_on_Ordinals
is Link from a Wikipage to another Wikipage of	1938 in philosophy 1938 in science Index of logic articles Jane Eliza Procter Fellowship List of important publications in mathematics List of mathematical logic topics Church–Turing thesis Alan Turing Hypercomputation Turing machine Ordinal logic
is foaf:primaryTopic of	wikipedia-en:Systems_of_Logic_Based_on_Ordinals

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software