Negative Modal Operators in Intuitionistic Logic
Displaying 61 – 80 of 171
Negative modal operators in intuitionistic logic.
Došen, Kosta (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Normal forms in partial modal logic
Jan Jaspars (1993)
Banach Center Publications
A "partial" generalization of Fine's definition [Fin] of normal forms in normal minimal modal logic is given. This means quick access to complete axiomatizations and decidability proofs for partial modal logic [Thi].
O dynamické logice
Petr Hájek, Pavel Kalášek, Petr Kůrka (1980)
Kybernetika
On Core XPath with Inflationary Fixed Points
Loredana Afanasiev, Balder Ten Cate (2013)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We prove the undecidability of Core XPath 1.0 (CXP) [G. Gottlob and C. Koch, in Proc. of 17th Ann. IEEE Symp. on Logic in Computer Science, LICS ’02 (Copenhagen, July 2002). IEEE CS Press (2002) 189–202.] extended with an Inflationary Fixed Point (IFP) operator. More specifically, we prove that the satisfiability problem of this language is undecidable. In fact, the fragment of CXP+IFP containing only the self and descendant axes is already undecidable.
On interpretability in theories containing arithmetic. II.
Petr Hájek (1981)
Commentationes Mathematicae Universitatis Carolinae
On Intuitionistic Sentential Connectives I.
E.G.K. López-Escobar (1985)
Revista colombiana de matematicas
On Lamport's comparison between linear and branching time temporal logic
Susanne Graf (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On some properties of grounding nonuniform sets of modal conjunctions
Radoslaw Katarzyniak (2006)
International Journal of Applied Mathematics and Computer Science
A language grounding problem is considered for nonuniform sets of modal conjunctions consisting of conjunctions extended with more than one modal operator of knowledge, belief or possibility. The grounding is considered in the context of semiotic triangles built from language symbols, communicative cognitive agents and external objects. The communicative cognitive agents are assumed to be able to observe external worlds and store the results of observations in internal knowledge bases. It is assumed...
On the geometry of intuitionistic S4 proofs.
Goubault-Larrecq, Jean, Goubault, Éric (2003)
Homology, Homotopy and Applications
On the relation of three-valued logic to modal logic
Kamila Bendová (1981)
Commentationes Mathematicae Universitatis Carolinae
On the representation of S5 algebras and their automorphism groups.
Mijajlović, Žarko (1987)
Publications de l'Institut Mathématique. Nouvelle Série
Polyadic algebras over nonclassical logics
Don Pigozzi, Antonino Salibra (1993)
Banach Center Publications
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.
Positive Logic with Double Negation
Milan Božić (1984)
Publications de l'Institut Mathématique
Positive logic with double negation.
Božić, Milan (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Preservation of admissibility of inference rules in the logics similar to S4. 2.
Rybakov, V.V., Rimatskij, V.V. (2002)
Sibirskij Matematicheskij Zhurnal
Propositional dynamic logic with recursive programs
Tinko Tinchev, Dimiter Vakarelov (1988)
Banach Center Publications
Provability in arithmetic and a schema of Grzegorczyk
George Boolos (1980)
Fundamenta Mathematicae
Remarks on intuitionistic modal logics.
Celani, Sergio (2001)
Divulgaciones Matemáticas
Representing Upper Probability Measures over Rational Lukasiewicz Logic.
E. Marchioni (2008)
Mathware and Soft Computing