Truncation and semi-decidability notions in applicative theories

, &
Journal of Symbolic Logic 83 (3):967-990 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2018.34

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

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

Totality in applicative theories.Gerhard Jäger & Thomas Strahm - 1995 - Annals of Pure and Applied Logic 74 (2):105-120.
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories.Gerhard Jäger & Dieter Probst - 2011 - Annals of Pure and Applied Logic 162 (8):647-660.
An elementary system as and its semi‐completeness and decidability.Qin Jun - 1992 - Mathematical Logic Quarterly 38 (1):305-320.
The Bernays—Schönfinkel—Ramsey class for set theory: decidability.Alberto Policriti & Eugenio Omodeo - 2012 - Journal of Symbolic Logic 77 (3):896-918.
Truth in applicative theories.Reinhard Kahle - 2001 - Studia Logica 68 (1):103-128.
Universes over Frege structures.Reinhard Kahle - 2003 - Annals of Pure and Applied Logic 119 (1-3):191-223.
N \hbox{\sf n} -strictness in applicative theories.Reinhard Kahle - 2000 - Archive for Mathematical Logic 39 (2):125-144.
Remarks on applicative theories.Andrea Cantini - 2005 - Annals of Pure and Applied Logic 136 (1-2):91-115.
More on The Decidability of Mereological Theories.Hsing-Chien Tsai - 2011 - Logic and Logical Philosophy 20 (3):251-265.
Gentzen-Style Sequent Calculus for Semi-intuitionistic Logic.Diego Castaño & Juan Manuel Cornejo - 2016 - Studia Logica 104 (6):1245-1265.
On the proof theory of type two functionals based on primitive recursive operations.David Steiner & Thomas Strahm - 2006 - Mathematical Logic Quarterly 52 (3):237-252.
Applicative theories for the polynomial hierarchy of time and its levels.Reinhard Kahle & Isabel Oitavem - 2013 - Annals of Pure and Applied Logic 164 (6):663-675.
Typability in Partial Applicative Structures.Inge Bethke & Piet Rodenburg - 2011 - Journal of Logic, Language and Information 20 (2):161-168.
Decidability, partial decidability and sharpness relation for l-subsets.Giangiacomo Gerla - 1987 - Studia Logica 46 (3):227-238.
Decidability of mereological theories.Hsing-Chien Tsai - 2009 - Logic and Logical Philosophy 18 (1):45-63.

Analytics

Added to PP
2018-10-25

Downloads
12 (#1,090,149)

6 months
5 (#648,432)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

The Lambda Calculus. Its Syntax and Semantics.E. Engeler - 1984 - Journal of Symbolic Logic 49 (1):301-303.
N \hbox{\sf n} -strictness in applicative theories.Reinhard Kahle - 2000 - Archive for Mathematical Logic 39 (2):125-144.

Add more references