Provability in Elementary Type Theory

Mathematical Logic Quarterly 20 (25‐27):411-418 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19740202506

Links

PhilArchive



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

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

A contextual type theory with judgemental modalities for reasoning from open assumptions.Giuseppe Primiero - 2012 - Logique and Analyse 220:579-600.
Cauchy completeness in elementary logic.J. C. Cifuentes, A. M. Sette & D. Mundici - 1996 - Journal of Symbolic Logic 61 (4):1153-1157.
Kripke semantics for provability logic GLP.Lev D. Beklemishev - 2010 - Annals of Pure and Applied Logic 161 (6):756-774.
Giving an account of provability within a theory.Peter Roeper - 2003 - Philosophia Mathematica 11 (3):332-340.
Types in Abstract Elementary Classes.Tapani Hyttinen - 2004 - Notre Dame Journal of Formal Logic 45 (2):99-108.
Lascar Types and Lascar Automorphisms in Abstract Elementary Classes.Tapani Hyttinen & Meeri Kesälä - 2011 - Notre Dame Journal of Formal Logic 52 (1):39-54.
On predicate provability logics and binumerations of fragments of Peano arithmetic.Taishi Kurahashi - 2013 - Archive for Mathematical Logic 52 (7-8):871-880.
On strong provability predicates and the associated modal logics.Konstantin N. Ignatiev - 1993 - Journal of Symbolic Logic 58 (1):249-290.
On first-order theories with provability operator.Sergei Artëmov & Franco Montagna - 1994 - Journal of Symbolic Logic 59 (4):1139-1153.
On the binding group in simple theories.Ziv Shami & Frank O. Wagner - 2002 - Journal of Symbolic Logic 67 (3):1016-1024.
How to extend the dialogical approach to provability logic.Ulrich Nortmann - 2001 - Synthese 127 (1-2):95 - 103.
All finitely axiomatizable subframe logics containing the provability logic CSM $_{0}$ are decidable.Frank Wolter - 1998 - Archive for Mathematical Logic 37 (3):167-182.
On the provability logic of bounded arithmetic.Rineke Verbrugge & Alessandro Berarducci - 1991 - Annals of Pure and Applied Logic 61 (1-2):75-93.
Towards an explanation of copula effects.Gerhard Jäger - 2003 - Linguistics and Philosophy 26 (5):557-593.

Analytics

Added to PP
2013-11-24

Downloads
15 (#889,556)

6 months
3 (#880,460)

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