Solomon Feferman  Home/Search
Context Related
| stanford.edu/pub/p...sentedlogics.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/pub/papers/feferm... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 PRA. The aims of this work are (i) conceptual, (ii) pedagogical and (iii) practical. The system FS 0 serves under (i) and (ii) as a theoretical framework for... (Update)
Context of citations to this paper: More
...only be achieved by considering appropriate flexible type theories above applicative theories. The reader is referred to Feferman [24, 25, 26, 27] for further information. This finishes our short discussion on finitary inductive data types. We have seen that N plays a...
...is crucial for logical frameworks. Indeed, in [9, 10] it is 1 taken to be their characteristic feature, and Feferman s framework FS 0 ([4]) is based on this observation. It is no wonder, therefore, that in the survey paper [8] it is stated that An important challenge for...
Cited by: More
Automating the Synthesis of Decision Procedures in a .. - Armando, Gallagher, .. (1996) (Correct)
Electronic Notes in Theoretical Computer Science 4 (1996) - Rewriting Logic As (1998) (Correct)
Maude as a Formal Meta-Tool - Clavel, Durán, Eker.. (1999) (Correct)
Active bibliography (related documents): More All
0.6: , 295--320, 1995. [103] Computation on data types. The.. - Annals Of Pure (Correct)
0.1: What Rests On What? The Proof-Theoretic Analysis Of Mathematics - Feferman (1992) (Correct)
0.1: Kreisel, Lambda Calculus, a Windmill and a Castle - Barendregt (1996) (Correct)
Similar documents based on text: More All
0.1: Highlights in Proof Theory - Feferman (2000) (Correct)
0.1: Proof Theory Since 1960 - Feferman (Correct)
0.1: Supersolubility and Finitary Groups - Pinnock (2000) (Correct)
Related documents from co-citation: More All
15: Metalogical frameworks - Basin, Constable - 1993
14: A framework for defining logics - Harper, Honsell et al. - 1987
13: Experience with FS0 as a framework theory - Matthews, Smaill et al. - 1993
BibTeX entry: (Update)
Solomon Feferman. Finitary inductively presented logics. In Logic Colloquium '88. North-Holland, 1988. http://citeseer.ist.psu.edu/feferman88finitary.html More
@incollection{ feferman94finitary,
author = "Solomon Feferman",
title = "Finitary Inductively Presented Logics",
booktitle = "What is a Logical System?",
publisher = "Oxford University Press",
address = "Oxford",
editor = "Dov Gabbay",
pages = "297--328",
year = "1994",
url = "citeseer.ist.psu.edu/feferman88finitary.html" }
Citations (may not include all citations):20 Symbolic Logic (context) - predicative - 1964
12 Lecture Notes in Mathematics (context) - proof - 1967
2 Symbolic Logic (context) - progressions, theories - 1962
1 Fundamenta mathematica (context) - metamathematics, setting - 1960
1 Abstract first-order computability (context) - order, Amer et al. - 1969
The graph only includes citing articles where the year of publication is known.
Documents on the same site (ftp://math.stanford.edu/pub/papers/feferman/): More
Three Conceptual Problems That Bug Me - Feferman (1996) (Correct)
Definedness - Feferman (1995) (Correct)
Ah, Chu! - Feferman (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC