Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Takeuti's_conjecture> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Takeuti's_conjecture abstract "In mathematics, Takeuti's conjecture is the conjecture of Gaisi Takeuti that a sequent formalisation of second-order logic has cut-elimination (Takeuti 1953). It was settled positively: By Tait, using a semantic technique for proving cut-elimination, based on work by Schütte (Tait 1966); Independently by Takahashi by a similar technique (Takahashi 1967); It is a corollary of Jean-Yves Girard's syntactic proof of strong normalization for System F.Takeuti's conjecture is equivalent to the consistency of second-order arithmetic and to the strong normalization of the Girard/Reynold's System F.".
- Takeuti's_conjecture wikiPageID "2372007".
- Takeuti's_conjecture wikiPageRevisionID "574387059".
- Takeuti's_conjecture hasPhotoCollection Takeuti's_conjecture.
- Takeuti's_conjecture subject Category:Conjectures.
- Takeuti's_conjecture subject Category:Proof_theory.
- Takeuti's_conjecture type Abstraction100002137.
- Takeuti's_conjecture type Cognition100023271.
- Takeuti's_conjecture type Concept105835747.
- Takeuti's_conjecture type Conjectures.
- Takeuti's_conjecture type Content105809192.
- Takeuti's_conjecture type Hypothesis105888929.
- Takeuti's_conjecture type Idea105833840.
- Takeuti's_conjecture type PsychologicalFeature100023100.
- Takeuti's_conjecture type Speculation105891783.
- Takeuti's_conjecture comment "In mathematics, Takeuti's conjecture is the conjecture of Gaisi Takeuti that a sequent formalisation of second-order logic has cut-elimination (Takeuti 1953).".
- Takeuti's_conjecture label "Takeuti's conjecture".
- Takeuti's_conjecture sameAs m.0777ds.
- Takeuti's_conjecture sameAs Q7678179.
- Takeuti's_conjecture sameAs Q7678179.
- Takeuti's_conjecture sameAs Takeuti's_conjecture.
- Takeuti's_conjecture wasDerivedFrom Takeuti's_conjecture?oldid=574387059.
- Takeuti's_conjecture isPrimaryTopicOf Takeuti's_conjecture.