N. Shankar  Home/Search
Context Related
| sri.com/reports/posts...cade92ns.ps.gz sri.com/reports/posts...cade92ns.ps.gz sri.com/papers/c/a/ca...cade92ns.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: sri.com/fmpapers (more) From: sri.com/fmpapers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The use of Herbrand functions (more popularly known as Skolemization) plays an important role in classical theorem proving and logic programming. We define a notion of Herbrand functions for the full intuitionistic predicate calculus. The definition is based on the view that the proof-theoretic role of Herbrand functions (to replace universal quantifiers), and of unification (to find instances corresponding to existential quantifiers), is to ensure that the eigenvariable conditions on a sequent ... (Update)
Context of citations to this paper: More
.... first order linear logic analog of the dynamic herbrandization (skolemization) technique earlier employed for intuitionistic logic in [33]. In this technique unification is postponed to the leaves of the search tree. 26] develops such a proof search procedure for first order...
.... rules) This re ects the lazy approach to uni cation in sequent calculi which makes the proof search much more ecient (see e.g. Shankar, 1992 ] for more details) We choose 0 as the initial label, intending the starting instant. Static rules preserve time labels: labels in...
Cited by: More
First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994) (Correct)
Uniform Variable Splitting - Antonsen (Correct)
Proof Search in First-order Linear Logic and Other Cut-free.. - Lincoln, Shankar (1994) (Correct)
Similar documents (at the sentence level):
24.3%: Proof Search in the Intuitionistic Sequent Calculus - Appeared In Proc (Correct)
Active bibliography (related documents): More All
0.3: A Resolution Theorem Prover for Intuitionistic Logic - Tammet (1996) (Correct)
0.2: A Structural Property on Modal Frames Characterizing Default.. - Amati, Aiello (1996) (Correct)
0.2: New Insights on the Intuitionistic Interpretation of Default.. - Cabalar, Lorenzo (Correct)
Similar documents based on text: More All
0.2: On Herbrand's Theorem - Buss (1995) (Correct)
0.1: A Tutorial on Using PVS for Hardware Verification - Owre, Rushby, Shankar, Srivas (1995) (Correct)
0.1: PVS: Combining Specification, Proof Checking, and.. - Owre, Rajan, Rushby, .. (1996) (Correct)
Related documents from co-citation: More All
11: Theoretical Computer Science (context) - Girard - 1987
9: Logic programming with focusing proofs in linear logic - Andreoli - 1992
9: Decision problems for propositional linear logic - Lincoln, Mitchell et al. - 1992
BibTeX entry: (Update)
Shankar, N.: "Proof search in the intuitionistic sequent calculus", in [23], 522--536. http://citeseer.ist.psu.edu/shankar91proof.html More
@incollection{ shankar92proof,
author = "Natarajan Shankar",
title = "Proof Search in the Intuitionistic Sequent Calculus",
booktitle = "Proceedings 11th Intl.\ Conf.\ on Automated Deduction, {CADE}'92, Saratoga Springs, {CA}, {USA}, 15--18 June 1992",
volume = "607",
publisher = "Springer-Verlag",
address = "Berlin",
editor = "D. Kapur",
pages = "522--536",
year = "1992",
url = "citeseer.ist.psu.edu/shankar91proof.html" }
Citations (may not include all citations):343 Introduction to Metamathematics (context) - Kleene - 1952
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
322 First-Order Logic and Automated Theorem Proving (context) - Fitting - 1990
62 The Collected Papers of Gerhard Gentzen (context) - Szabo - 1969
50 Higher-order Horn clauses - Nadathur, Miller - 1990
46 Specifying theorem provers in a higher-order logic programmi.. (context) - Felty, Miller - 1988
42 Gentzen-type systems and resolution rules (context) - Mints - 1988
30 Permutability of inferences in Gentzen's calculi LK and LJ (context) - Kleene - 1952
26 A decidable fragment of predicate calculus (context) - Ketonen, Weyhrauch - 1984
23 Automated Proof Search in Non-Classical Logics (context) - Wallen - 1990
13 A man-machine theorem-proving system (context) - Bledsoe, Bruell - 1974
11 Programming with full first-order logic (context) - Bowen - 1982
9 Investigations in proof theory (context) - Herbrand - 1967
7 Investigations into proof-search in a system of first-order .. (context) - Pym, Wallen - 1990
7 On intuitionistic arithmetic and number theory (context) - Godel - 1986
7 Some applications of Gentzen's proof theory in automated ded.. (context) - Beeson - 1988
4 An interpretation of the intuitionistic propositional calcul.. (context) - Godel - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csl.sri.com/fm-papers.html): More
PVS: A Prototype Verification System - Reprint From (Correct)
[12] Sam Owre, John Rushby, Natarajan Shankar, and.. - Fme Industrial-Strength (Correct)
Mechanical Verification of a Generalized Protocol for Byzantine.. - Shankar (1992) (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