Results 271 to 280 of about 106,571 (322)
Some of the next articles are maybe not open access.
A Translation of Intuitionistic Predicate Logic into Basic Predicate Logic
Studia Logica, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
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
Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic
Journal of Symbolic Logic, 2000AbstractRational 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
openaire +3 more sources
The logical simplicity of predicates
Journal of Symbolic Logic, 1949In 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 Logical Framework for Graded Predicates
2017In this position paper we present a logical framework for modelling reasoning with graded predicates. We distinguish several types of graded predicates and discuss their ubiquity in rational interaction and the logical challenges they pose. We present mathematical fuzzy logic as a set of logical tools that can be used to model reasoning with graded ...
Cintula P., Noguera C., Smith N. J. J.
openaire +4 more sources
Propositional and Predicate Logic
2016Propositional logic is the study of propositions, where a proposition is a statement that is either true or false. Propositionallogic may be used to encode simple arguments that are expressed in natural language, and to determine their validity. The validity of an argument may be determined from truth tables, or using the inference rules such as modus ...
openaire +2 more sources
Modal Foundations for Predicate Logic
Logic Journal of IGPL, 1997See the review of the author's paper with the same title in: E. Orlowska (ed.), Logic at work (Physica-Verlag, Heidelberg), Stud. Fuzziness Soft Comput. 24, 39-54 (1999; Zbl 0923.03019).
openaire +3 more sources
Monadic Fuzzy Predicate Logics
Studia Logica, 2002The paper is a contribution to the development of fuzzy logic, namely to the arithmetic properties of the monadic fuzzy predicate logic. The author first recalls basic results in classical monadic predicate logic, which is complete and decidable, and then shows that in fuzzy logic this problem is much more complicated and interesting.
openaire +3 more sources
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 ...
openaire +2 more sources
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 ...
openaire +2 more sources
On Predicate Logic as Modal Logic
1999The clause for existential formulas in the Tarskian definition of satisfaction for predicate logic can be written as follows: $${\text{A}},{\kern 1pt} \alpha \left| { = {\kern 1pt} \exists x\varphi {\kern 1pt} \Leftrightarrow {\kern 1pt} {\text{there}}{\kern 1pt} is{\kern 1pt} \beta {\kern 1pt} {\text{such that }}\alpha {\kern 1pt} {{\text{ = }}_x}\
openaire +2 more sources

