About: Ordinal logic

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

About: Ordinal logic Goto Sponge NotDistinct Permalink

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

http://dbpedia.demo.openlinksw.com/c/9s2fSRJYvG

In mathematics, ordinal logic is a logic associated with an ordinal number by recursively adding elements to a sequence of previous logics. The concept was introduced in 1938 by Alan Turing in his PhD dissertation at Princeton in view of Gödel's incompleteness theorems.

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 yago:System105661996 yago:WikicatSystemsOfFormalLogic
rdfs:label	Ordinal logic (en)
rdfs:comment	In mathematics, ordinal logic is a logic associated with an ordinal number by recursively adding elements to a sequence of previous logics. The concept was introduced in 1938 by Alan Turing in his PhD dissertation at Princeton in view of Gödel's incompleteness theorems. (en)
dct:subject	Systems of formal logic Mathematical logic Ordinal numbers
Wikipage page ID	32123297 (xsd:integer)
Wikipage revision ID	1115874214 (xsd:integer)
Link from a Wikipage to another Wikipage	Systems of Logic Based on Ordinals Mathematics Alan Turing Systems of formal logic Gödel's incompleteness theorems Mathematical logic Ordinal numbers Ordinal number Constructive ordinal
sameAs	Ordinal logic Ordinal logic Ordinal logic Ordinal logic
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Mathlogic-stub
has abstract	In mathematics, ordinal logic is a logic associated with an ordinal number by recursively adding elements to a sequence of previous logics. The concept was introduced in 1938 by Alan Turing in his PhD dissertation at Princeton in view of Gödel's incompleteness theorems. While Gödel showed that every logic system suffers from some form of incompleteness, Turing focused on a method so that a complete system of logic may be constructed from a given system of logic. By repeating the process a sequence L1, L2, … of logic is obtained, each more complete than the previous one. A logic L can then be constructed in which the provable theorems are the totality of theorems provable with the help of the L1, L2, … etc. Thus Turing showed how one can associate logic with any constructive ordinal. (en)
gold:hypernym	Logic
prov:wasDerivedFrom	wikipedia-en:Ordinal_logic?oldid=1115874214&ns=0
page length (characters) of wiki page	1576 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Ordinal_logic
is Link from a Wikipage to another Wikipage of	Systems of Logic Based on Ordinals Alan Turing
is foaf:primaryTopic of	wikipedia-en:Ordinal_logic

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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