Frege Structures for Partial Applicative Theories

  title={Frege Structures for Partial Applicative Theories},
  author={Reinhard Kahle},
  journal={J. Log. Comput.},
  • R. Kahle
  • Published 1 October 1999
  • Philosophy
  • J. Log. Comput.
Due to strictness problems, usually the syntactical definition of Frege structures is conceived as a truth theory for total applicative theories. To investigate Frege structures in a partial framework we can follow two ways. First, simply by ignoring undefinedness in the truth definition. Second, by introducing of a certain notion of pointer. Both approaches are compatible with the traditional formalizations of Frege structures and preserve the main results, namely abstraction and the proof… 

Universes over Frege structures

  • R. Kahle
  • Philosophy
    Ann. Pure Appl. Log.
  • 2003

Truth in Applicative Theories

This work presents as a novelty a syntactical interpretation of ID1 in a applicative truth theory based on supervaluation of Frege structures, and presents the proof-theoretic results for these theories and shows their syntACTical expressive power.

A feasible theory of truth over combinatory algebra

On Applicative Theories

Systems of explicit mathematics were introduced in Feferman [7, 9] in order to give a logical account to Bishop-style constructive mathematics, and they soon turned out to be very important for the

Sets, Truth, and Recursion

We discuss some philosophical aspects of an intensional set theory based on an axiomatic truth theory. This set theory gains its justification from natural truth axioms combined with standard

Applicative Theories and Explicit Mathematics

[5] Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive µ-operator. [6] Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive


  • R. Kahle
  • Philosophy
    The Review of Symbolic Logic
  • 2011
The resulting set theory is discussed with respect to its historical and philosophical significance and includes the treatment of diagonalization in the presence of a universal set.

Extraction of Programs for Exact Real Number Computation Using Agda

This thesis contains the to the authors' knowledge first research project to extract in the theorem prover Agda programs from proofs involving postulated axioms using postulated data types and functions in Agda without giving any computational rules.



Extending the first-order theory of combinators with self-referential truth

  • A. Cantini
  • Philosophy, Computer Science
    Journal of Symbolic Logic
  • 1993
A formal system STW of self-referential truth, which extends the classical first-order theory of pure combinators with a truth predicate and certain approximation axioms, and provides a smooth inner model for Myhill's systems with levels of implication.

Partial Applicative Theories and Explicit Substitutions

This paper designs a weakening of the partial A calculus, which can be embedded into partial combinatory logic and uses explicit substitutions, which have previously been studied in the literature in connection with the implementation of functional programming languages.

Totality in Applicative Theories

A New Formalization of Feferman's System of Functions and Classes and Its Relation to Frege Structure

A new axiomatization of Feferman’s systems of functions and classes is given, which has a finite number of class constructors resembling the proposition constructors of Frege structure by Aczel.

Hilbert's program relativized; Proof-theoretical and foundational reductions

Here a body of proof-theoretical results stemming from H.P. are surveyed in a way that is closely tied to various reductive foundational aims, albeit going beyond those advanced by Hilbert.

Implication and analysis in classical frege structures

Combinators and classes

  • D. Scott
  • Mathematics
    Lambda-Calculus and Computer Science Theory
  • 1975
The paper tries to answer the question: What is the relation between class abstraction and λ-abstraction in models for the λ-calculus?