Finitary inductively presented logics

@inproceedings{Feferman1994FinitaryIP,
  title={Finitary inductively presented logics},
  author={Solomon Feferman},
  year={1994}
}
Abstract A notion of finitary inductively presented (f-i.p.) logic is proposed here, which includes all syntactically described logics (formal systems) met in practice. A f.i.p. theory FS 0 is set up which is universal for all f.i.p. logics; though formulated as a theory of functions and classes of expressions, FS 0 is a conservative extension of PR A. The aims of this work are (i) conceptual, (ii) pedagogical and (iii) practical. The system FSQ serves under (i) and (ii) as a theoretical… CONTINUE READING
BETA

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 31 CITATIONS

Constructibility and decidability versus domain independence and absoluteness

  • Theor. Comput. Sci.
  • 2008
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On the Proof Theory of Applicative Theories

VIEW 47 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Max-planck-institut for Informatik Authors' Addresses Publication Notes

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Experience with F S 0 as a Framework Theory

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Parameterized Metareasoning in Membership Equational Logic

  • Formal Modeling: Actors, Open Systems, Biological Systems
  • 2011
VIEW 1 EXCERPT
CITES METHODS