Kripke models for linear logicALLWEIN, G; DUNN, J. M.The Journal of symbolic logic. 1993, Vol 58, Num 2, pp 514-545, issn 0022-4812Conference Paper

A NOTE ON KRIPKE'S DISTINCTION BETWEEN RIGID DESIGNATORS AND NON-RIGID DESIGNATORSCHAKRAVARTI SS.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 2; PP. 309-313; BIBL. 4 REF.Article

KRIPKE ON CONTINGENT A PRIORI TRUTHSCHAKRAVARTI SS.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 4; PP. 773-776; BIBL. 6 REF.Article

A Kripke-style model for the admissibility of structural rulesGOGUEN, Healfdene.Lecture notes in computer science. 2002, pp 112-124, issn 0302-9743, isbn 3-540-43287-6Conference Paper

Halldén-completeness by gluing of kripke framesVAN BENTHEM, J. F. A. K; HUMBERSTONE, I. L.Notre Dame journal of formal logic. 1983, Vol 24, Num 4, pp 426-430, issn 0029-4527Article

NECESSITAS CONSEQUENTIS IN A SINGLETON POSSIBLE WORLD.MURUNGI RW.1977; NOTRE DAME J. FORM. LOGIC; U.S.A.; DA. 1977; VOL. 18; NO 4; PP. 637-638; BIBL. 5 REF.Article

On the logical content of Computational type theory: A solution to Curry's problemFAIRTLOUGH, Matt; MENDLER, Michael.Lecture notes in computer science. 2002, pp 63-78, issn 0302-9743, isbn 3-540-43287-6Conference Paper

Ancestral Kripke models and nonhereditary Kripke models for the Heyting propositional calculusDOSEN, K.Notre Dame journal of formal logic. 1991, Vol 32, Num 4, pp 580-597, issn 0029-4527Article

Quelques relations entre les réseaux de Petri: la logique dynamique et les méthodes de la sémantique dénotationnelle = Some relations between Petri nets: dynamical logic and the methods of denotational semanticSANCHEZ LEIGHTON, Vicente.1983, 86 fThesis

Relational representability for algebras of substructural logicsORŁOWSKA, Ewa; RADZIKOWSKA, Anna Maria.Lecture notes in computer science. 2006, pp 212-224, issn 0302-9743, isbn 3-540-33339-8, 1Vol, 13 p.Conference Paper

Topo-distance : Measuring the difference between spatial patternsAIELLO, Marco.Lecture notes in computer science. 2000, pp 73-86, issn 0302-9743, isbn 3-540-41131-3Conference Paper

An arithmetical ompleteness theorem for pre-permutationsTUTTAS, F.Notre Dame journal of formal logic. 1993, Vol 34, Num 1, pp 84-89, issn 0029-4527Article

SOME APPLICATIONS OF KRIPKE MODELS TO FORMAL SYSTEMS OF INTUITIONISTIC ANALYSISWEINSTEIN S.1979; ANN. MATH. LOGIC; NLD; DA. 1979; VOL. 15; NO 1; PP. 1-32; BIBL. 16 REF.Article

A characterization of lambda definability in categorical models of implicit polymorphismALIMOHAMED, M.Theoretical computer science. 1995, Vol 146, Num 1-2, pp 5-23, issn 0304-3975Article

MODELLI DI KRIPKE E MODELLI ALGEBRICI PER SPI _I = MODELES DE KRIPKE ET MODELES ALGEBRIQUES POUR SPI _IMARCHINI C.1981; RIV. MAT. UNIV. PARMA; ISSN 0035-6298; ITA; DA. 1981; VOL. 7; PP. 105-116; ABS. ENG; BIBL. 7 REF.Article

Getting belief functions from Kripke modelsHAJEK, P.International journal of general systems (Print). 1996, Vol 24, Num 3, pp 325-327, issn 0308-1079Article

Intuitionistic Epistemic Logic, Kripke Models and Fitch's ParadoxPROIETTI, Carlo.Journal of philosophical logic. 2012, Vol 41, Num 5, pp 877-900, issn 0022-3611, 24 p.Article

Action Emulation between Canonical ModelsSIETSMA, Floor; VAN EIJCK, Jan.Journal of philosophical logic. 2013, Vol 42, Num 6, pp 905-925, issn 0022-3611, 21 p.Conference Paper

TREES IN KRIPKE MODELS AND IN AN INTUITIONISTIC REFUTATION SYSTEMMIGLIOLI P; MOSCATO U; ORNAGHI M et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 316-331; BIBL. 20 REF.Conference Paper

A PROPOSITIONAL LOGIC WITH EXPLICIT FIXED POINTSVISSER A.1981; STUD. LOGICA; ISSN 0039-3215; POL; DA. 1981; VOL. 40; NO 2; PP. 155-175; BIBL. 10 REF.Article

SOME CLASSES OF KRIPKE FRAMES CHARACTERISTIC FOR THE INTUITIONISTIC LOGICKIRK RE.1979; Z. MATH. LOGIK GRUNDL. MATH.; DDR; DA. 1979; VOL. 25; NO 5; PP. 409-410; BIBL. 6 REF.Article

ON THE MODAL LOGIC CORRESPONDING TO DIAGONALIZABLE ALGEBRA THEORYBELLISSIMA F.1978; BOLL. UN. MAT. ITAL.; ITA; DA. 1978; VOL. 15B; NO 3; PP. 915-930; ABS. ITA; BIBL. 7 REF.Article

A MODEL SYSTEM PROPERLY INDEPENDENT OF BOTH THE BROUNWERIAN SYSTEM AND 84.GEORGACARAKOS GN.1978; NOTRE DAME J. FORM. LOGIC; U.S.A.; DA. 1978; VOL. 19; NO 1; PP. 101-114; BIBL. 2 REF.Article

Structure-preserving binary relations for program abstractionSCHMIDT, David A.The essence of computation (complexity, analysis, transformation). Lecture notes in computer science. 2002, pp 245-265, issn 0302-9743, isbn 3-540-00326-6, 21 p.Book Chapter

On multi-agent systems specification via Deontic logicLOMUSCIO, Alessio; SERGOT, Marek.Lecture notes in computer science. 2002, pp 86-99, issn 0302-9743, isbn 3-540-43858-0, 14 p.Conference Paper