Results 281 to 290 of about 939,241 (354)

Elementary Predicate Logic

, 1983
Elementary (first-order) predicate logic is a child of many parents. At least three different groups of thinkers played their part in its conception, with three quite distinct motives. Maybe the mixture gave it hybrid strength. But whatever the reason, first-order logic is both the simplest, the most powerful and the most applicable branch of modern ...
W. Hodges
semanticscholar   +3 more sources

A semantic study of the first-order predicate logic with uncertainty involved

Fuzzy Optimization and Decision Making, 2014
Xiang Li
exaly   +2 more sources

A Van Benthem/Rosen theorem for coalgebraic predicate logic

Journal of Logic and Computation, 2015
A BSTRACT . Coalgebraic modal logic serves as a unifying framework to study a wide range of modal logics beyond the relational realm, including probabilistic and graded logics as well as conditional logics and logics based on neighbourhoods and games ...
Lutz Schröder, D. Pattinson, Tadeusz Litak   +2 more
semanticscholar   +1 more source

DRT and Predicate Logic [PDF]

, 1993
The central task of this book is to show how English sentences give rise to semantic representations. We will refer to the semantic representations we will be constructing as Discourse Representation Structures, or, more succinctly, DRSs.
Hans Kamp, Uwe Reyle
openaire   +1 more source

On Predicate Logic [PDF]

, 2004
Without explicitly saying so, we have been using a characteristic element of predicate logic from the start — the logic variables \({X_i}\mathop \Leftrightarrow \limits^{df} {x_i} = 1\) and \({Y_i}\mathop \Leftrightarrow \limits^{df} {y_i} = 1\). Then, in the last chapter, we made extensive use of a typical tool of predicate logic — the generalised OR (
openaire   +1 more source

Predicate Logics on Display [PDF]

, 1998
Display systems introduced by N. Belnap treat the modality \(\square\) using an ``inverse'' connective \(\bigcirc\) (sometimes in the past) and the following rules: \(\bigcirc A\to X/A\to\square X\) and \(A\to X/\square A\to\bigcirc X\). The author extends this treatment to predicate logic using \(\bigcirc_x\) indexed by variable \(x\).
openaire   +2 more sources

Probabilistic models for intuitionistic predicate logic

Journal of Logic and Computation, 2011
This article deals with some probabilistic model theory for intuitionistic predicate logic. We introduce the notions of intuitionistic probability, probabilistic structure for intuitionistic predicate logic and model of an intuitionistic probability.
G. Georgescu
semanticscholar   +1 more source

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

Journal 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, Petr Hájek, Jeff B. Paris   +2 more
openaire   +3 more sources

The logical simplicity of predicates

Journal of Symbolic Logic, 1949
In an earlier article, I proposed a way of determining the relative simplicity of different sets of extralogical primitives. The calculations assumed a fully platonistic logic, committed to an indefinite hierarchy of classes, with sequences and relations defined as classes. Recently it has been shown that a nominalistic logic, countenancing no entities
openaire   +3 more sources

A translation of intuitionistic predicate logic into basic predicate logic

Studia Logica, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources