Daniel Leivant  Home/Search
Context Related
Links: ACM | indiana.edu/pub/techreport...TR388.ps.Z indiana.edu/pub/techreport...TR388.ps.Z 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: indiana.edu/ftp/techrepor...index (more) From: indiana.edu/ftp/techrepor...index (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2 The expressive power of second order Logic : : : : : : : : : : : 3 2.1 The language of second order logic : : : : : : : : : : : : : 3 2.2 Expressing size : : : : : : : : : : : : : : : : : : : : : : : : 4 2.3 Defining data types : : : : : : : : : : : : : : : : : : : : : 6 2.4 Describing processes : : : : : : : : : : : : : : : : : : : : : 8 2.5 Expressing convergence using second order validity : : : : : : : : :... (Update)
Context of citations to this paper: More
.... which are definable within the language; this does not necessarily account for all the subsets in the domain; 28 we refer to (Leivant 1994) for a discussion of this point. In our machanised proofs we rely on a common higher order practice of reducing all axioms to...
.... aspects of higher order logic have been given by Feferman [Fef78] Andrews [And86] van Bentham and Doets [vBD83] and Leivant [Lei94] and elegantly within it. Given such embeddings, it is easy to recognize those fragments that are well supported by automation. The...
Cited by: More
MIQIS: Modular Integration of Queryable Information Systems - Wyss Fletcher Erdinc (2004) (Correct)
Using Decision Procedures With a Higher-Order Logic - Shankar (2001) (Correct)
Region-Based Qualitative Geometry - Bennett, Cohn, Torrini, Hazarika (2000) (Correct)
Active bibliography (related documents): More All
1.0: On The Strength Of König's Duality Theorem For Countable.. - Simpson (1992) (Correct)
0.9: Second-Order Logic and Foundations of Mathematics - Väänänen (2001) (Correct)
0.9: Self-Checking Prover Study - Final Report - Gordon, Herbert, Hale.. (1995) (Correct)
Similar documents based on text: More All
0.1: Tarskian Set Constraints - Givan, McAllester, Witty, Kozen (1996) (Correct)
0.0: Tarskian Set Constraints are in NEXPTIME - Mielniczuk, Pacholski (1998) (Correct)
0.0: Classical Brouwer-Heyting-Kolmogorov interpretation - Sato (1997) (Correct)
Related documents from co-citation: More All
6: The frame problem in the situation calculus: a simple solution (context) - Reiter - 1991
5: Golog: A logic programming language for dynamic domains - Levesque, Reiter et al. - 1997
5: A structural approach to operational semantics - Plotkin - 1981
BibTeX entry: (Update)
D. Leivant. Higher order logic. In Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 2, pages 229-- 321. Clarendon Press, 1994. http://citeseer.ist.psu.edu/leivant94higher.html More
@incollection{ leivant94higher,
author = "Daniel Leivant",
title = "Higher Order Logic",
booktitle = "Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 2: Deduction Methodologies",
publisher = "Clarendon Press",
address = "Oxford",
editor = "D. M. Gabbay and C. J. Hogger and J. A. Robinson",
pages = "229--321",
year = "1994",
url = "citeseer.ist.psu.edu/leivant94higher.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965 ACM DBLP
505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable - 1986 ACM
434 A framework for defining logics - Harper, Honsell et al. - 1987
419 A formulation of the simple theory of types (context) - Church - 1949 DBLP
382 Lambda calculi with types - Barendregt - 1992 ACM
343 Introduction to Metamathematics (context) - Kleene - 1952
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991 ACM DBLP
325 Towards a theory of type structure (context) - Reynolds - 1974
268 Proofs and Types (context) - Girard, Lafont et al. - 1989
266 Information and Computation (context) - Coquand, Huet et al. - 1988 DBLP
259 Combinatory Logic (context) - Curry, Feys - 1958
241 Decidability of second order theories and automata on infini.. (context) - Rabin - 1969
229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967 ACM
227 North-Holland (context) - Chang, Keisler - 1973
216 Theoretical Computer Science (context) - Milner, Tofte et al. - 1991 ACM
210 Generalized first order spectra and polynomial time recogniz.. (context) - Fagin - 1974
200 Introduction to Mathematical Logic (context) - Mendelson - 1964
189 Computable queries for relational data bases - Chandra, Harel - 1980 DBLP
184 Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972
174 A unification algorithm for typed -calculus (context) - Huet - 1975
166 An overview of - prolog (context) - Nadathur, Miller - 1988
163 Universality of data retrieval languages (context) - Aho, Ullman - 1979
152 Semantics of Programming Languages (context) - Gunter - 1992 ACM
151 An Introduction to Mathematical Logic and Type Theory: To Tr.. (context) - Andrews - 1986 ACM
149 Logic and the challenge of computer science (context) - Gurevich - 1987
145 Isabelle: The next 700 theorem provers (context) - Paulson - 1990
143 The Coq proof assistant user's guide (context) - Dowek, Felty et al. - 1991
141 Constructive mathematics and computer programming (context) - Martin-Lof - 1980 ACM
139 Types systems for programming languages (context) - Mitchell - 1990
133 Cambridge University Press (context) - Hodges - 1993
131 The essence of Algol (context) - Reynolds - 1981 ACM
129 The foundation of a generic theorem prover - Paulson - 1989 ACM DBLP
128 Logic and Computation: Interactive Proof with Cambridge LCF (context) - Paulson - 1987 ACM
121 Proving and applying program transformations expressed with .. (context) - Huet, Lang - 1978 DBLP
120 Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
116 Ideas and results in proof theory (context) - Prawitz - 1972
109 A polymorphic type system for prolog (context) - Mycroft, O'Keef - 1984 DBLP
101 Higher-order logic programming - Miller, Nadathur - 1986 ACM DBLP
101 Higher order logic programming - Miller - 1993
101 Programming with Sets: An Introduction to SETL (context) - Schwarts, Dewar et al. - 1986
97 The undecidability of the second order unification problem (context) - Goldfarb - 1981
97 An introduction to inductive definitions (context) - Aczel - 1977
96 A survey of the project AUTOMATH (context) - de Bruijn - 1980
95 Fixed-point extensions of first-order logic (context) - Gurevich, Shelah - 1986 DBLP
94 General Topology (context) - Kelley - 1955
91 A final coalgebra theorem (context) - Aczel, Mendler - 1989
86 Completeness in the theory of types (context) - Henkin - 1950 DBLP
83 Cylindric Algebras (context) - Henkin, Monk et al. - 1971
82 Typeful programming - Cardelli - 1991
81 Mathematical Logic (context) - Ebbinghaus, Flum et al. - 1984
76 Towards a mathematical semantics for computer languages (context) - Scott, Strachey - 1971
73 Denotational semantics (context) - Mosses - 1990 ACM DBLP
71 An intuitionistic theory of types: Predicative part (context) - Martin-Lof - 1973
71 Elf: A language for logic definition and verified meta-progr.. - Pfenning - 1989
70 Preliminary design of the programming language Forsythe (context) - Reynolds - 1988
68 An extension of basic functionality theory for -calculus (context) - Coppo, Dezani-Ciancaglini - 1980
63 Toward logic tailored for computational complexity - Gurevich - 1984
60 Constructions: A higher order proof system for mechanizing m.. (context) - Coquand, Huet - 1985 DBLP
53 Implementing tactics and tacticals in a higher order program.. - Felty - 1993
51 A semantic basis for Quest - Cardelli, Longo - 1991 ACM DBLP
51 Handbook of Mathematical Logic (context) - Barwise - 1977
50 Introduction to Mathematical Logic (context) - Church - 1956
50 Higher-order horn clauses - Nadathur, Miller - 1990 ACM DBLP
49 Range and degree of realizability of formulas in the restric.. (context) - Glebskii, Kogan et al. - 1969
49 A co-induction principle for recursively defined domains - Pitts - 1993 ACM DBLP
46 A consideration on normal form of not necessarily normalized.. (context) - Makinouchi - 1977
46 Specifying theorem provers in a higher-order logic programmi.. (context) - Felty, Miller - 1988 ACM DBLP
45 A new approach to database logic (context) - Kuper, Vardi - 1984 ACM DBLP
43 Typed prolog: A semantic reconstruction of the Mycroft-O'Kee.. (context) - Lakshman, Reddy - 1991
43 Candidats de Reductibilit'e (context) - Gallier - 1990
42 Resolution in type theory (context) - Andrews - 1971 DBLP
41 Computational metatheory in Nuprl (context) - Howe - 1988 ACM DBLP
40 Iterated Inductive Definitions and Subsystems of Analysis: H.. (context) - Buchholz, Feferman et al. - 1981
39 Mathematical logic as based on the theory of types (context) - Russell - 1908
38 Languages which capture complexity classes (context) - Immerman - 1987 ACM
36 and computational complexity (context) - Abiteboul, Vardi et al. - 1992
36 Monadic second-order theories (context) - Gurevich - 1985
34 Borel determinacy (context) - Martin - 1975
34 The decision problem for the probabilities of higher-order p.. (context) - Kolaitis, Vardi - 1987 ACM DBLP
33 Foundations of Set Theory (context) - Fraenkel, Bar-Hillel - 1958
33 Foundations of Set Theory (context) - Fraenkel, Bar-Hillel et al. - 1973
33 Une Th'eorie des Constructions (context) - Coquand - 1985
32 Implementing the meta-theory of deductive systems - Pfenning, Rohwedder - 1991
32 Set Theory and the Continuum Hypothesis (context) - Cohen - 1966
31 A higher-order logic as the basis for logic programming - Nadathur - 1987 ACM
31 Contracting proofs to programs (context) - Leivant - 1990
31 laws in logic and combinatorics (context) - Compton - 1988
30 Proof theory: Some applications of cut-elimination (context) - Schwichtenberg - 1977
30 Theories of finite type related to mathematical practice (context) - Feferman - 1977
29 ese de Doctorat d (context) - Girard, et et al. - 1972
28 Annals of Pure and Applied Logic (context) - Kraj'icek, number et al. - 1989
28 Proofs in higher-order logic (context) - Miller - 1983
27 Automating higher-order logic (context) - Andrews, Miller et al. - 1984
27 Abstractions in logic programming (context) - Miller - 1989
26 Raven Press (context) - Davis, Undecidable - 1965
26 Monotone versus positive (context) - Ajtai, Gurevich - 1987
25 A mathematical incompleteness in Peano Arithmetic (context) - Paris, Harrington - 1977
23 Mathematical logic (context) - Kreisel - 1965
23 Induction rules and termination proofs (context) - Hitchcock, Park - 1973 DBLP
22 Mathematical Logic (context) - Monk - 1976
21 Formalized metareasoning in type theory (context) - Knoblock, Constable - 1986 ACM DBLP
20 Systems of predicative analysis (context) - Feferman - 1964 DBLP
20 order type theory through unification (context) - Jensen, Pietrzykowski - 1976
19 Unpublished manuscript (context) - Scott, de Bakker et al. - 1969
19 Second order and inductive definability on finite structures (context) - de Rougemont - 1987
18 Uses of higher-order unification for implementing program tr.. (context) - Hannan, Miller - 1988 DBLP
17 Turing machines and the spectra of first order formulas (context) - Jones, Selman - 1974
17 Some remarks on infinitely long formulas (context) - Henkin - 1961
17 Reasoning about functional programs and complexity classes a.. (context) - Leivant - 1983 DBLP
16 A compact representation of proofs (context) - Miller - 1987
16 Database theory column: Query languages for complex object d.. (context) - Abiteboul, Kanellakis - 1990 DBLP
16 Acta Philosophica Fennica (context) - Hintikka, the et al. - 1955
15 Philosophy of Logic (context) - Quine - 1970
14 Reflection principles and their use for establishing the com.. (context) - Kreisel, Levy - 1968
14 Almqvist and Wiksell (context) - Prawitz - 1965
14 Syntactic translations and provably recursive functions (context) - Leivant - 1985 DBLP
14 A system of axiomatic set theory (context) - Bernays - 1937
14 Nonprovability of certain combinatorial properties of finite.. (context) - Simpson - 1985
14 A foundational delineation of computational feasiblity (context) - Leivant - 1991
14 Inductive definitions over finite structures (context) - Leivant - 1990
13 What is logic (context) - Hacking - 1979
13 D'emonstration automatique dans le Calcul des Constructions (context) - Dowek - 1991
13 Higher-order logic (context) - van Benthem, Doets - 1983
12 Existential fixedpoint logic (context) - Blass, Gurevich - 1987
12 programs from proofs in the calculus of constructions (context) - Paulin-Mohring - 1989
12 laws for infinitary logics (context) - Kolaitis, Vardi - 1990
12 A survey of proof theory (context) - Kreisel - 1968 DBLP
12 Systems of second order arithmetic with restricted induction (context) - Friedman - 1976
11 On branching quantifiers in English (context) - Barwise - 1979
11 Annals of Pure and Applied Logic (context) - Sieg, arithmetic - 1985
11 New foundations for mathematical logic (context) - Quine - 1937
10 Model-theoretic logics: Background and aims (context) - Barwise - 1985
10 Equivalents of the Axiom of Choice (context) - Rubin, Rubin - 1966
10 A realistic compiler generator based on high-level semantics (context) - Lee, Pleban - 1987 DBLP
9 Global inductive definability (context) - Barwise, Moschovakis - 1978 DBLP
9 Recursion in higher types (context) - Kechris, Moschovakis - 1977
9 the forms of the predicates in the theory of constructive or.. (context) - Kleene - 1955
9 A finite combinatorial principles which is equivalent to the.. (context) - Friedman, McAloon et al. - 1982
9 General models and extensionality (context) - Andrews - 1972 DBLP
8 Countable algebra and set existence axioms (context) - Friedman, Simpson et al. - 1983
8 Fixpoint induction and proof of program semantics (context) - Park - 1970
8 Formal structures for computation and deduction - Huet - 1986
8 Abbreviating proofs by adding new axioms (context) - Ehrenfeucht, Mycielski - 1971
7 Hauptsatz for higher order logic (context) - Prawitz - 1968 DBLP
7 Which set existence axioms are needed to prove the Cauchy/Pe.. (context) - Simpson - 1984
7 Journal of Symbolic Logic (context) - Sieg, Simpson - 1990
7 A Transfinite Type Theory with Type Variables (context) - Andrews - 1965
7 Some results on the length of proofs (context) - Parikh - 1973
7 Enriching a metalanguage with higher-order features (context) - Hannan, Miller - 1988
6 Finite partially ordered quantifiers (context) - Enderton - 1970
6 A Theory of Sets (context) - Morse - 1965
6 laws for fragments of second-order logic: An overview (context) - Kolaitis, Vardi - 1992
5 Set theoretic aspects of ATR (context) - Simpson - 1982
5 Truth-Value Semantics (context) - Leblanc - 1976
5 Friedman's research on subsystems of second order arithmetic (context) - Simpson - 1985
5 Set theoretic foundations for constructive analysis (context) - Friedman - 1977
5 On extensions of elementary logic (context) - Lindstrom - 1969
5 Automatic Documentation and Mathematical Linguistics (context) - Livchak, model et al. - 1983
5 and Reverse Mathematics (context) - Simpson - 1986
5 Some systems of second order arithmetic and their use (context) - Friedman - 1975
5 Iterated inductive definitions and \Sigma 1 2 -AC (context) - Friedman - 1970
5 Du role de l'intuition et de la logique en math'ematiques (context) - Poincar'e - 1902
5 Foundation without Foundationalism: A Case for Second-Order .. (context) - Shapiro - 1991
5 Pspace survives three-bit bottlenecks (context) - Cai, Furst - 1987
4 Sense and denotation as algorithm and value - Moschovakis - 1993
4 Set theory and higher order logic (context) - Montague - 1965
4 The undecidability of the second order predicate unification.. (context) - Amiot - 1990
4 Computable directory queries (context) - Dahlhaus, Makowsky - 1987 ACM DBLP
4 A survey of proof theory II (context) - Kreisel - 1971
4 A Source Book in Mathematical Logic (context) - van Heijenoort, to - 1967
4 A guide to polymorphic types (context) - Scedrov - 1990
3 A construction for models of consistent systems (context) - Novak - 1951
3 ese, Universit (context) - Paulin-Mohring, dans et al. - 1989
3 Nonstandard models for formal logic (context) - Rosse, Wang - 1950
3 Axiomatic Set Theory (context) - Bernays - 1958
3 and choice in type theory (context) - Andrews, descriptions - 1972
3 New kinds of realizability (context) - Dragalin - 1979
3 Characterizing second order logic with first order quantifie.. (context) - Harel - 1979
2 Theoretical Computer Science (context) - Blass, Gurevich et al. - 1986 ACM
2 The Hanf number of second order logic (context) - Barwise - 1972
2 Systems of predicative analysis II (context) - Feferman - 1968
2 definable sets of integers (context) - Lubarsky - 1993
2 The role of the axiom of induction in elementary arithmetic (context) - Ryll-Nardzewski - 1953
2 the power of languages for manipulating complex objects (context) - Abiteboul, Beeri - 1988
2 Hauptsatz for intuitionistic simple type theory (context) - Martin-Lof - 1973
2 Embedding first order predicate logic in fragments of intuit.. (context) - Lob - 1976 DBLP
2 Reductions of higher-order logic (context) - Montague - 1965
2 Mimeographed notes (context) - Kreisel, proof - 1963
2 Mechanizing higher order logic (context) - Robinson - 1969
2 Sentences Undecidable in Formalized Arithmetic: An Expositio.. (context) - Mostowski - 1952
2 On second order logic (context) - Boolos - 1975
2 Subsystems of set theory and analysis (context) - Friedman - 1967
2 the problem of schemata of infinity in axiomatic set theory (context) - Bernays - 1976
1 Beweistheoretische Untersuchung der versweigten Analysis (context) - Schutte - 1952
1 Logic programming based on higher-order hereditary harrop fo.. (context) - Miller - 1988
1 Beweistheoretische Erfassung der unendlischen Induktion in d.. (context) - Schutte - 1951
1 Uber die Unabh¨angigkeit des Wohlordungssatzes vom Ordungpri.. (context) - Mostowski - 1939
1 Principles of reflection in axiomatic set theory (context) - Levy - 1960
1 Some impredicative definitions in the axiomatic set theory (context) - Mostowski - 1951
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/ftp/techreports/index.html): More
Topological Reasoning and The Logic of Knowledge - Dabrowski, Moss, Parikh (Correct)
Merging Interactive, Modular, And Object-Oriented Programming - Tung (Correct)
First-Class Extents - Shinn-Der Lee (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