Syntactic Preservation Theorems for Intuitionistic Predicate Logic
نویسندگان
چکیده
منابع مشابه
Interpolation theorems for intuitionistic predicate logic
Craig interpolation theorem (which holds for intuitionistic logic) implies that the derivability of X,X’-¿Y’ implies existence of an interpolant I in the common language of X and X’-¿Y’ such that both X-¿I and I,X’-¿Y’ are derivable. For classical logic this extends to X,X’-¿Y,Y’, but for intuitionistic logic there are counterexamples. There is a version true for intuitionistic propositional (b...
متن کاملAutomata Theory Approach to Predicate Intuitionistic Logic
Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We present a model of automata that can handle proof construction in full intuitionistic first-order logic. The automata are constructed in such a way that any ...
متن کاملAN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملNonmodal Classical Linear Predicate Logic is a Fragment of Intuitionistic Linear Logic
DoSen, K. Nonmodal classical linear predicate logic is a fragment of intuitionistic linear logic, Theoretical Computer Science 102 (1992) 207-214. It is shown that nonmodal classical linear first-order predicate logic based on multiplicative conjunction, additive disjunction, negation, the propositional constants and the existential quantifier is included in intuitionistic linear first-order pr...
متن کاملResolution for Predicate Logic
A substitution is a function θ from the set of σ-terms back to itself such that (writing function application on the right) cθ = c for each constant symbol c and f(t1, . . . , tk)θ = f(t1θ, . . . , tkθ) for each k-ary function symbol f . It is clear that the composition of two such substitutions (as functions) is also a substitution. We have previously considered substitutions of the form [t/x]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2010
ISSN: 0029-4527
DOI: 10.1215/00294527-2010-014