A theorem on labelled trees and the limits of its provability

Mathematical Logic Quarterly 36 (2):107-122 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19900360204

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Back to basics: Revisiting the incompleteness theorems.Peter Smith - unknown
Ramsey’s theorem for trees: the polarized tree theorem and notions of stability. [REVIEW]Damir D. Dzhafarov, Jeffry L. Hirst & Tamara J. Lakins - 2010 - Archive for Mathematical Logic 49 (3):399-415.
Provability logic in the Gentzen formulation of arithmetic.Paolo Gentilini & P. Gentilini - 1992 - Mathematical Logic Quarterly 38 (1):535-550.
On Provability Logics with Linearly Ordered Modalities.Lev D. Beklemishev, David Fernández-Duque & Joost J. Joosten - 2014 - Studia Logica 102 (3):541-566.
The differences between Kurepa trees and Jech-Kunen trees.Renling Jin - 1993 - Archive for Mathematical Logic 32 (5):369-379.
Partitions of trees and $${{\sf ACA}^\prime_{0}}$$.Bernard A. Anderson & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (3-4):227-230.
No Escape from Vardanyan's theorem.Albert Visser & Maartje de Jonge - 2006 - Archive for Mathematical Logic 45 (5):539-554.
Degrees of Relative Provability.Mingzhong Cai - 2012 - Notre Dame Journal of Formal Logic 53 (4):479-489.
Provability logics for natural Turing progressions of arithmetical theories.L. D. Beklemishev - 1991 - Studia Logica 50 (1):107 - 128.
On strong provability predicates and the associated modal logics.Konstantin N. Ignatiev - 1993 - Journal of Symbolic Logic 58 (1):249-290.
Grammar induction by unification of type-logical lexicons.Sean A. Fulop - 2010 - Journal of Logic, Language and Information 19 (3):353-381.
Realization of Intuitionistic Logic by Proof Polynomials.Sergei N. Artemov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):285-301.
Forcing disabled.M. C. Stanley - 1992 - Journal of Symbolic Logic 57 (4):1153-1175.
A propositional logic with explicit fixed points.Albert Visser - 1981 - Studia Logica 40 (2):155 - 175.
Herbrand consistency of some arithmetical theories.Saeed Salehi - 2012 - Journal of Symbolic Logic 77 (3):807-827.

Analytics

Added to PP
2013-12-01

Downloads
7 (#1,356,784)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references