Results 211 to 220 of about 102,741 (269)

An extension to predicate logic of $lambdarho$-calculus (Logics, Algebras and Languages in Computer Science)

open access: yesAn extension to predicate logic of $lambdarho$-calculus (Logics, Algebras and Languages in Computer Science)
openaire  

Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic

open access: closedJournal of Symbolic Logic, 2000
AbstractRational Pavelka logic extends Łukasiewicz infinitely valued logic by adding truth constants r̄ for rationals in [0. 1]. We show that this is a conservative extension. We note that this shows that provability degree can be defined in Łukasiewicz logic. We also give a counterexample to a soundness theorem of Belluce and Chang published in 1963.
John C. Shepherdson   +2 more
semanticscholar   +4 more sources

Set abstraction—An extension of all solutions predicate in logic programming language

open access: closedNew Generation Computing, 1987
The concept of set abstraction is introduced as a simple analogy of that of lambda abstraction in the theory of lambda calculus. The set abstraction is concerned with two extensions concerning Prolog language features: “set expression” and “predicate variable.” It has been argued in the literature that the set expression extension to Prolog does really
Takashi Yokomori
semanticscholar   +4 more sources

Constructing a continuum of predicate extensions of each intermediate propositional logic

open access: closedStudia Logica, 1995
Wajsberg and Jankov provided us with methods of constructing a continuum of logics. However, their methods are not suitable for super-intuitionistic and modal predicate logics. The aim of this paper is to present simple ways of modification of their methods appropriate for such logics. We give some concrete applications as generic examples.
Norihiro Suzuki
semanticscholar   +4 more sources

On the Predicate Logic of Linear Kripke Frames and some of its Extensions [PDF]

open access: closedStudia Logica, 2005
We propose a new, rather simple and short proof of Kripke-completeness for the predicate variant of Dummett's logic. Also a family of Kripke-incomplete extensions of this logic that are complete w.r.t. Kripke frames with equality (or equivalently, w.r.t. Kripke sheaves [8]), is described.
D. P. Skvortsov
openaire   +2 more sources

On Conservative Extensions in Logics with Infinitary Predicates

open access: closedStudia Logica, 2009
If the language is extended by new individual variables, in classical first order logic, then the deduction system obtained is a conservative extension of the original one. This fails to be true for the logics with infinitary predicates. But it is shown that restricting the commutativity of quantifiers and the equality axioms in the extended system and
Miklós Ferenczi
openaire   +3 more sources

Home - About - Disclaimer - Privacy