Takeuti's conjecture
Theorem in formal logic
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 Prawitz (Prawitz 1968) and Takahashi by a similar technique (Takahashi 1967), although Prawitz's and Takahashi's proofs are not limited to second-order logic, but concern higher-order logics in general; It is a corollary of Jean-Yves Girard's s...
Nº Q7678179 ★★★
Rara · Saberes
Takeuti's conjecture
Theorem in formal logic
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 Prawitz (Prawitz 1968) and Takahashi by a similar technique (Takahashi 1967), although Prawitz's and Takahashi's proofs are not limited to second-order logic, but concern higher-order logics in general; It is a corollary of Jean-Yves Girard's s...
Último precio
—
Precio mínimo
—
Mediana 7 d
—
Ventas 30 d
0
Rango 30 d
—
En circulación
0
Cotización
mediana
mín – máx
ventas
Sin ventas en el periodo
Ver tabla
| Fecha | mediana | Mín | Máx | ventas |
|---|
Historial de ventas
- Última venta
- —
- Media 30 d
- —
- Mínimo 30 d
- —
- Máximo 30 d
- —
- Ventas 7 d
- 0
- Ventas 30 d
- 0
Aún no hay ventas.
Ventas anónimas: sin comprador ni vendedor. Las cifras solo cuentan ventas entre jugadores.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
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 Prawitz (Prawitz 1968) and Takahashi by a similar technique (Takahashi 1967), although Prawitz's and Takahashi's proofs are not limited to second-order logic, but concern higher-order logics in general; It is a corollary of Jean-Yves Girard's syntactic proof of strong normalization for System F. Takeuti's conjecture is equivalent to the 1-consistency of second-order arithmetic in the sense that each of the statements can be derived from each other in the weak system of primitive recursive arithmetic (PRA). It is also equivalent to the strong normalization of the Girard/Reynold's System F.
Texto: Wikipedia en inglés, CC BY-SA 4.0. ·
Cartas cercanas
Cálculo de secuentes
Nº Q1771121 ★
Inter-universal Teichmüller theory
Mathematical theory by Shinichi Mochizuki
Nº Q19597596 ★★★★
System F
Typed lambda calculus
Nº Q2552799 ★
Lógica intuicionista
Nº Q176786 ★★
Crouzeix's conjecture
Unsolved problem in matrix analysis
Nº Q65074161 ★★★
Dixmier conjecture
Conjecture in algebra
Nº Q5284929 ★★