Undecidability of the completeness problem of modal logic
S. Thomason (1982)
Banach Center Publications
Similarity:
S. Thomason (1982)
Banach Center Publications
Similarity:
Daniel Leivant (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
Shokoofeh Ghorbani (2020)
Bulletin of the Section of Logic
Similarity:
In this paper, we introduce and study a corresponding logic to equality-algebras and obtain some basic properties of this logic. We prove the soundness and completeness of this logic based on equality-algebras and local deduction theorem. We show that this logic is regularly algebraizable with respect to the variety of equality∆-algebras but it is not Fregean. Then we introduce the concept of (prelinear) equality∆-algebras and investigate some related properties. Also, we study ∆-deductive...
E. G. K. López-Escobar, Francisco Miraglia
Similarity:
Arkadiusz Wójcik (2020)
Bulletin of the Section of Logic
Similarity:
The dynamic epistemic logic for actual knowledge models the phenomenon of actual knowledge change when new information is received. In contrast to the systems of dynamic epistemic logic which have been discussed in the past literature, our system is not burdened with the problem of logical omniscience, that is, an idealized assumption that the agent explicitly knows all classical tautologies and all logical consequences of his or her knowledge. We provide a sound and complete axiomatization...
M.-A. Nait Abdallah (1988)
Banach Center Publications
Similarity:
Wiktor Bartol, Ewa Orłowska, Andrzej Skowron (1999)
Banach Center Publications
Similarity:
James J. Lu, Jacques Calmet, Joachim Schü (1997)
Mathware and Soft Computing
Similarity:
The logic of signed formula can be used to reason about a wide variety of multiple-valued logics [Häh94b, LMR97]. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in [Lu96]. The current paper is an investigation into the operational semantics of such signed logic programming. The connection of signed logic programming to constraint logic programming is presented, search space issues are briefly discussed for both general and...
И. Резников (1967)
Algebra i Logika
Similarity:
Javier Legris, Jorge A. Molina (2001)
Philosophia Scientiae
Similarity:
In this paper we analyze the consideration of intuitionistic logic as an extension of classical logic. This — at first sight surprising — point of view has been sustained explicitly by Jan Łukasiewicz on the basis of a mapping of classical propositional logic into intuitionistic propositional logic by Kurt Gödel in 1933. Simultaneously with Gödel, Gerhard Gentzen had proposed another mapping of Peano´s arithmetic into Heyting´s arithmetic. We shall discuss these mappings in connection...
Don Pigozzi, Antonino Salibra (1993)
Banach Center Publications
Similarity:
The polyadic algebras that arise from the algebraization of the first-order extensions of a SIC are characterized and a representation theorem is proved. Standard implicational calculi (SIC)'s were considered by H. Rasiowa [19] and include classical and intuitionistic logic and their various weakenings and fragments, the many-valued logics of Post and Łukasiewicz, modal logics that admit the rule of necessitation, BCK logic, etc.
Andrzej Grzegorczyk (1968)
Compositio Mathematica
Similarity: