Results 1  10
of
64
Axiomatizing Reflective Logics and Languages
 Proceedings of Reflection'96
, 1996
"... The very success and breadth of reflective techniques underscores the need for a general theory of reflection. At present what we have is a wideranging variety of reflective systems, each explained in its own idiosyncratic terms. Metalogical foundations can allow us to capture the essential aspects ..."
Abstract

Cited by 37 (20 self)
 Add to MetaCart
The very success and breadth of reflective techniques underscores the need for a general theory of reflection. At present what we have is a wideranging variety of reflective systems, each explained in its own idiosyncratic terms. Metalogical foundations can allow us to capture the essential aspects of reflective systems in a formalismindependent way. This paper proposes metalogical axioms for reflective logics and declarative languages based on the theory of general logics [34]. In this way, several strands of work in reflection, including functional, equational, Horn logic, and rewriting logic reflective languages, as well as a variety of reflective theorem proving systems are placed within a common theoretical framework. General axioms for computational strategies, and for the internalization of those strategies in a reflective logic are also given. 1 Introduction Reflection is a fundamental idea. In logic it has been vigorously pursued by many researchers since the fundamental wor...
Prooftheoretic investigations on Kruskal's theorem
 Ann. Pure Appl. Logic
, 1993
"... In this paper we calibrate the exact prooftheoretic strength of Kruskal's theorem, thereby giving, in some sense, the most elementary proof of Kruskal's theorem. Furthermore, these investigations give rise to ordinal analyses of restricted bar induction. Introduction S.G. Simpson in his ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
(Show Context)
In this paper we calibrate the exact prooftheoretic strength of Kruskal's theorem, thereby giving, in some sense, the most elementary proof of Kruskal's theorem. Furthermore, these investigations give rise to ordinal analyses of restricted bar induction. Introduction S.G. Simpson in his article [10], "Nonprovability of certain combinatorial properties of finite trees", presents prooftheoretic results, due to H. Friedman, about embeddability properties of finite trees. It is shown there that Kruskal's theorem is not provable in ATR 0 . An exact description of the prooftheoretic strength of Kruskal's theorem is not given. On the assumption that there is a bad infinite sequence of trees, the usual proof of Kruskal's theorem utilizes the existence of a minimal bad sequence of trees, thereby employing some form of \Pi 1 1 comprehension. So the question arises whether a more constructive proof can be given. The need for a more elementary proof of Kruskal's theorem is especially felt ...
FirstOrder Logic of Proofs
, 2011
"... The propositional logic of proofs LP revealed an explicit provability reading of modal logic S4 which provided an indented provability semantics for the propositional intuitionistic logic IPC and led to a new area, Justification Logic. In this paper, we find the firstorder logic of proofs FOLP capa ..."
Abstract

Cited by 26 (10 self)
 Add to MetaCart
(Show Context)
The propositional logic of proofs LP revealed an explicit provability reading of modal logic S4 which provided an indented provability semantics for the propositional intuitionistic logic IPC and led to a new area, Justification Logic. In this paper, we find the firstorder logic of proofs FOLP capable of realizing firstorder modal logic S4 and, therefore, the firstorder intuitionistic logic HPC. FOLP enjoys a natural provability interpretation; this provides a semantics of explicit proofs for firstorder S4 and HPC compliant with BrouwerHeytingKolmogorov requirements. FOLP opens the door to a general theory of firstorder justification.
Metaprogramming in Logic
 ENCYCLOPEDIA OF COMPUTER SCIENCE AND TECHNOLOGY
, 1994
"... In this review of metaprogramming in logic we pay equal attention to theoretical and practical issues: the contents range from mathematical and logical preliminaries to implementation and applications in, e.g., software engineering and knowledge representation. The area is one in rapid development b ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
In this review of metaprogramming in logic we pay equal attention to theoretical and practical issues: the contents range from mathematical and logical preliminaries to implementation and applications in, e.g., software engineering and knowledge representation. The area is one in rapid development but we have emphasized such issues that are likely to be important for future metaprogramming languages and methodologies.
Functionality in the Basic Logic of Proofs
, 1993
"... This report describes the elimination of the injectivity restriction for functional arithmetical interpretations as used in the systems PF and PFM in the Basic Logic of Proofs. An appropriate axiom system PU in a language with operators "x is a proof of y" is defined and proved to be sound ..."
Abstract

Cited by 18 (13 self)
 Add to MetaCart
This report describes the elimination of the injectivity restriction for functional arithmetical interpretations as used in the systems PF and PFM in the Basic Logic of Proofs. An appropriate axiom system PU in a language with operators "x is a proof of y" is defined and proved to be sound and complete with respect to all arithmetical interpretations based on functional proof predicates. Unification plays a major role in the formulation of the new axioms.
Hilbert’s Program Then and Now
, 2005
"... Hilbert’s program is, in the first instance, a proposal and a research program in the philosophy and foundations of mathematics. It was formulated in the early 1920s by German mathematician David Hilbert (1862–1943), and was pursued by him and his collaborators at the University of Göttingen and els ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Hilbert’s program is, in the first instance, a proposal and a research program in the philosophy and foundations of mathematics. It was formulated in the early 1920s by German mathematician David Hilbert (1862–1943), and was pursued by him and his collaborators at the University of Göttingen and elsewhere in the 1920s
A Basis for a Multilevel Metalogic Programming Language
 Logic Program Synthesis and Transformation – MetaProgramming in Logic. LNCS 883
, 1994
"... We are developing a multilevel metalogic programming language that we call Alloy. It is based on firstorder predicate calculus extended with metalogical constructs. An Alloy program consists of a collection of theories, all in the same language, and a representation relation over these theories. Th ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
(Show Context)
We are developing a multilevel metalogic programming language that we call Alloy. It is based on firstorder predicate calculus extended with metalogical constructs. An Alloy program consists of a collection of theories, all in the same language, and a representation relation over these theories. The whole language is selfrepresentable, including names for expressions with variables. A significant difference, as compared with many previous approaches, is that an arbitrary number of metalevels can be employed and that the objectmeta relationship between theories need not be circular. The language is primarily intended for representation of knowledge and metaknowledge and is currently being used in research on hierarchical representation of legal knowledge. We believe that the language allows sophisticated expression and efficient automatic deduction of interesting sets of beliefs of agents. This paper aims to give a preliminary and largely informal definition of the core of the langua...