Results 1  10
of
1,574
A firstorder predicate calculus
 Journal of Formalized Mathematics
, 1990
"... Summary. A continuation of [7], with an axiom system of firstorder predicate theory. The consequence Cn of a set of formulas X is defined as the intersection of all theories containing X and some basic properties of it has been proved (monotonicity, idempotency, completeness etc.). The notion of a ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Summary. A continuation of [7], with an axiom system of firstorder predicate theory. The consequence Cn of a set of formulas X is defined as the intersection of all theories containing X and some basic properties of it has been proved (monotonicity, idempotency, completeness etc.). The notion of a
A FirstOrder Predicate Calculus
"... Summary. A continuation of [3], with an axiom system of firstorder predicate theory. The consequence Cn of a set of formulas X is defined as the intersection of all theories containing X and some basic properties of it has been proved (monotonicity, idempotency, completness etc.). The notion of a pr ..."
Abstract
 Add to MetaCart
Summary. A continuation of [3], with an axiom system of firstorder predicate theory. The consequence Cn of a set of formulas X is defined as the intersection of all theories containing X and some basic properties of it has been proved (monotonicity, idempotency, completness etc.). The notion of a
Binary decision diagrams for firstorder predicate logic
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2003
"... ..."
Expressing Set Theory in FirstOrder Predicate Logic
, 2000
"... Here we present a firstorder formalization of set theory that has a finite number of axioms and which syntax is similar to the one often used in books: it provides an encoding of the comprehension symbol. Other formalizations of set theory exist: Zermelo theory with existence axioms is firstorder ..."
Abstract
 Add to MetaCart
Here we present a firstorder formalization of set theory that has a finite number of axioms and which syntax is similar to the one often used in books: it provides an encoding of the comprehension symbol. Other formalizations of set theory exist: Zermelo theory with existence axioms is firstorder
Translating the Object Constraint Language into Firstorder Predicate Logic
 In Proceedings, VERIFY, Workshop at Federated Logic Conferences (FLoC
, 2002
"... In this paper, we define a translation of UML class diagrams with OCL constraints into firstorder predicate logic. The goal is logical reasoning about UML models, realized by an interactive theorem prover. We put an emphasis on usability of the formulas resulting from the translation, and we hav ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
In this paper, we define a translation of UML class diagrams with OCL constraints into firstorder predicate logic. The goal is logical reasoning about UML models, realized by an interactive theorem prover. We put an emphasis on usability of the formulas resulting from the translation, and we
Arithmetical complexity of firstorder predicate fuzzy logics over distinguished semantics
 Journal of Logic and Computation
"... All promiment examples of firstorder predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiable sentences. This paper is a contribution to the general study of this problem. We propose the classes of firstorder core ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
All promiment examples of firstorder predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiable sentences. This paper is a contribution to the general study of this problem. We propose the classes of firstorder
Binary decision diagrams for first order predicate logic
 JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING 57:1–22
, 2003
"... We present an extension of Binary Decision Diagrams (BDDs) such that they can be used for predicate logic. We present a sound and complete proof search method which we apply to a number of examples. ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We present an extension of Binary Decision Diagrams (BDDs) such that they can be used for predicate logic. We present a sound and complete proof search method which we apply to a number of examples.
AN EQUATIONAL APPROACH TO THEOREM PROVING in firstorder predicate calculus
, 1985
"... A new approach for proving theorems in firstorder predicate calculus is developed based on term rewriting and polynomial simplification methods. A formula is translat ed into an equivalent set of formulae expressed in terms of 'true', 'false', 'exclusiveor', and &apos ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
A new approach for proving theorems in firstorder predicate calculus is developed based on term rewriting and polynomial simplification methods. A formula is translat ed into an equivalent set of formulae expressed in terms of 'true', 'false', &apos
First Order Predicate Calculus and Logic Programming
"... Contents 1. Syntax of a First Order Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1 Scope, Variables, and Formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Substitutions . . . . . . . . . . . . . . . . . . ..."
Abstract
 Add to MetaCart
Contents 1. Syntax of a First Order Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1 Scope, Variables, and Formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Substitutions
DT  An Automated Theorem Prover for MultipleValued FirstOrder Predicate Logics
 IN PROC. 26TH INTERNATIONAL SYMPOSIUM ON MULTIPLEVALUED LOGICS
, 1996
"... We describe the automated theorem prover "Deep Thought" ( d DT ). The prover can be used for arbitrary multiplevalued firstorder logics, provided the connectives can be defined by truth tables and the quantifiers are generalizations of the classical universal resp. existential quantifie ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
quantifiers. d DT has been tested with many interesting multiplevalued logics as well as classical firstorder predicate logic. d DT uses a freevariable semantic tableau calculus with generalized signs. For the existential tableaurules two liberalized versions are implemented. The system utilizes a static
Results 1  10
of
1,574