Results 1  10
of
57
Theory Interpretation in Simple Type Theory
 HIGHERORDER ALGEBRA, LOGIC, AND TERM REWRITING, VOLUME 816 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1993
"... Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself. This paper presents a method for theory interpretation in a version of simple type theory, called lutins, which admit ..."
Abstract

Cited by 36 (17 self)
 Add to MetaCart
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself. This paper presents a method for theory interpretation in a version of simple type theory, called lutins, which admits partial functions and subtypes. The method is patterned on the standard approach to theory interpretation in rstorder logic. Although the method is based on a nonclassical version of simple type theory, it is intended as a guide for theory interpretation in classical simple type theories as well as in predicate logics with partial functions.
Interpretability logic
 Mathematical Logic, Proceedings of the 1988 Heyting Conference
, 1990
"... Interpretations are much used in metamathematics. The first application that comes to mind is their use in reductive Hilbertstyle programs. Think of the kind of program proposed by Simpson, Feferman or Nelson (see Simpson[1988], Feferman[1988], Nelson[1986]). Here they serve to compare the strength ..."
Abstract

Cited by 32 (9 self)
 Add to MetaCart
Interpretations are much used in metamathematics. The first application that comes to mind is their use in reductive Hilbertstyle programs. Think of the kind of program proposed by Simpson, Feferman or Nelson (see Simpson[1988], Feferman[1988], Nelson[1986]). Here they serve to compare the strength of theories, or better to prove
A New Method for Undecidability Proofs of First Order Theories
 Journal of Symbolic Computation
, 1992
"... this paper is to define a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a term algebra modulo the axioms of associativity and commutativity and of the theory of a partial lexicographic path ordering. 1. Introduction ..."
Abstract

Cited by 30 (7 self)
 Add to MetaCart
this paper is to define a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a term algebra modulo the axioms of associativity and commutativity and of the theory of a partial lexicographic path ordering. 1. Introduction
On the Difference between Bridge Rules and Lifting Axioms
 Modeling and Using Context, number 2680 in Lecture Notes in Artificial Intelligence
, 2003
"... In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context (PLC) and Local Models Semantics/MultiContext Systems (LMS/MCS). The result was that LMS/MCS is at least as general as PLC, as i ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context (PLC) and Local Models Semantics/MultiContext Systems (LMS/MCS). The result was that LMS/MCS is at least as general as PLC, as it can be embedded into a particular class of MCS, called MPLC. In this paper we go beyond that result, and prove that, under some important restrictions (including the hypothesis that each context has finite and homogeneous propositional languages), MCS can be embedded in PLC with generic axioms. To prove this theorem, we prove that MCS cannot be embedded in PLC using only lifting axioms to encode bridge rules. This is an important result for a general theory of context and contextual reasoning, as it proves that lifting axioms and entering context are not enough to capture all forms of contextual reasoning that can be captured via bridge rules in LMS/MCS.
The Interpretability Logic of all Reasonable Arithmetical Theories
 ERKENNTNIS
, 1999
"... This paper is a presentation of a status quaestionis, to wit of the problem of the interpretability logic of all reasonable arithmetical theories. We present both the arithmetical side and the modal side of the question. ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
This paper is a presentation of a status quaestionis, to wit of the problem of the interpretability logic of all reasonable arithmetical theories. We present both the arithmetical side and the modal side of the question.
Hierarchies of Decidable Extensions of Bounded Quantification
 IN 22ND ACM SYMP. ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 1994
"... The system F , the wellknown secondorder polymorphic typed calculus with subtyping and bounded universal type quantification [CW85, BL90, CG92, Pie92, CMMS94], appears to be undecidable [Pie92] because of undecidability of its subtyping component. Attempts were made to obtain decidable type sys ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
The system F , the wellknown secondorder polymorphic typed calculus with subtyping and bounded universal type quantification [CW85, BL90, CG92, Pie92, CMMS94], appears to be undecidable [Pie92] because of undecidability of its subtyping component. Attempts were made to obtain decidable type systems with subtyping by weakening F [CP94, KS92], and also by reinforcing or extending it [Vor94a, Vor94b, Vor95]. However, for the moment, these extensions lack the important prooftheoretic minimum type property, which holds for F and guarantees that each typable term has the minimum type, being a subtype of any other type of the term in the same context [CG92, Vor94c]. As a preparation step to introducing the extensions of F with the minimum type property and the decidable term typing relation (which we do in [Vor94e]), we define and study here the hierarchies of decidable extensions of the F subtyping relation. We demonstrate conditions providing that each theory in a hierarchy: 1. ext...
On the Use of Reduction Relations to Relate Different Types of Agent Models
"... This paper focuses on relationships between agent models and their physical realisations. Approaches on reduction from philosophical literature are analysed in a formalised manner, and extended by incorporating contextdependency w.r.t. specific makeups for their realisations. It is shown how thes ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This paper focuses on relationships between agent models and their physical realisations. Approaches on reduction from philosophical literature are analysed in a formalised manner, and extended by incorporating contextdependency w.r.t. specific makeups for their realisations. It is shown how these contextdependent reduction approaches can be translated into each other and how they can be applied to relate agent models.
Can we make the Second Incompleteness Theorem coordinate free?
 DEPARTMENT OF PHILOSOPHY, UTRECHT UNIVERSITY, HEIDELBERGLAAN
"... Is it possible to give a coordinate free formulation of the Second Incompleteness Theorem? We pursue one possible approach to this question. We show that (i) cutfree consistency for finitely axiomatized theories can be uniquely characterized modulo EAprovable equivalence, (ii) consistency for fin ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Is it possible to give a coordinate free formulation of the Second Incompleteness Theorem? We pursue one possible approach to this question. We show that (i) cutfree consistency for finitely axiomatized theories can be uniquely characterized modulo EAprovable equivalence, (ii) consistency for finitely axiomatized sequential theories can be uniquely characterized modulo EAprovable equivalence. The case of infinitely axiomatized ce theories is more delicate. We carefully discuss this in the paper.