## Found 185 Documents (Results 1–100)

100
MathJax

MSC:  68-XX
Full Text:

### The modal logic $$\mathsf{LEC}$$ for changing knowledge, expressed in the growing language. (English)Zbl 1486.03036

MSC:  03B42 03B45
Full Text:

MSC:  03-XX
Full Text:

### The modal logic of $$\sigma$$-centered forcing and related forcing classes. (English)Zbl 07370806

MSC:  03E40 03B45
Full Text:

### Dual and axiomatic systems for constructive S4, a formally verified equivalence. (English)Zbl 07297792

Felty, Amy (ed.) et al., 14th international workshop on logical and semantic frameworks, with applications, LSFA 2019, Natal, Brazil, in August 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 348, 61-83 (2020).
MSC:  03B45 68V15
Full Text:

### On combinatorial proofs for modal logic. (English)Zbl 1435.03041

Cerrito, Serenella (ed.) et al., Automated reasoning with analytic tableaux and related methods. 28th international conference, TABLEAUX 2019, London, UK, September 3–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11714, 223-240 (2019).
MSC:  03B45 03F07
Full Text:

MSC:  03B45
Full Text:

### Axiomatic and dual systems for constructive necessity, a formally verified equivalence. (English)Zbl 1444.03054

MSC:  03B45 03B35
Full Text:

MSC:  03B45
Full Text:

Full Text:

### Logics for approximate entailment in ordered universes of discourse. (English)Zbl 1352.68252

MSC:  68T37 03B45 68T27
Full Text:

### Terminating sequent calculi for proving and refuting formulas in S4. (English)Zbl 1325.03019

MSC:  03B45 03F07 03F05
Full Text:

### Restricted interpolation over modal logic S4. (English. Russian original)Zbl 1311.03040

Algebra Logic 52, No. 4, 308-335 (2013); translation from Algebra Logika 52, No. 4, 461-501 (2013).
MSC:  03B45
Full Text:

### Strong completeness of S4 for any dense-in-itself metric space. (English)Zbl 1326.03025

MSC:  03B45 54E35
Full Text:

Full Text:

### Realization theorem for epistemic logic with justification. (English)Zbl 1254.03023

MSC:  03B42 03B45 03B62

### Dynamic measure logic. (English)Zbl 1278.03046

MSC:  03B45 28A60
Full Text:

### Completeness of $$\mathrm S4$$ for the Lebesgue measure algebra. (English)Zbl 1368.03023

MSC:  03B45 28A60
Full Text:

### On construction of an explicit basis for admissible inference rules of modal logics extending S4.1. (English. Russian original)Zbl 1261.03089

Discrete Math. Appl. 21, No. 5-6, 741-760 (2011); translation from Diskretn. Mat. 23, No. 4, 48-65 (2011).
MSC:  03B45 03G25 08B20
Full Text:

### Classical natural deduction for S4 modal logic. (English)Zbl 1251.68071

MSC:  68N18 03B45 03B70
Full Text:

### A tableau method for checking rule admissibility in S4. (English)Zbl 1345.03033

Bolander, Thomas (ed.) et al., Proceedings of the 6th workshop on methods for modalities (M4M-6 2009), Copenhagen, Denmark, November 12–14, 2009. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 262, 17-32 (2010).
MSC:  03B45
Full Text:

MSC:  18D10 18C15 03B45
Full Text:

### On the simple substitution property for superintuitionistic and modal propositional logics. (English. Russian original)Zbl 1269.03026

Dokl. Math. 78, No. 3, 923-924 (2008); translation from Dokl. Akad. Nauk., Ross. Akad. Nauk. 423, No. 6, 740-742 (2008).
MSC:  03B45 03B55
Full Text:

MSC:  03B45
Full Text:

### The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4F, S4R, S4M and G. (English)Zbl 1169.03008

MSC:  03A05 03B45
Full Text:

### Independent bases of admissible rules. (English)Zbl 1146.03008

MSC:  03B45 03B55
Full Text:

### Density of truth in modal logics. (English)Zbl 1191.03013

Fourth colloquium on mathematics and computer science IV. Algorithms, trees, combinatorics and probabilities. Papers based on the presentations at the colloquium, Nancy, France, September 18–22, 2006. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 161-170, electronic only (2006).
MSC:  03B45
Full Text:

### Existential semantics for modal logic. (English)Zbl 1279.03039

Artemov, Sergei (ed.) et al., We will show them! Essays in honour of Dov Gabbay on his 60th birthday. Volume 1. London: College Publications (ISBN 1-904987-11-7/pbk; 1-904987-25-7/hbk). Tributes 1, 19-29 (2005).
MSC:  03B45 03B42 03F45

### Path calculus in the modal logic S4. (English. Russian original)Zbl 1076.03014

Lith. Math. J. 45, No. 1, 94-101 (2005); translation from Liet. Mat. Rink. 45, No. 1, 117-126 (2005).
MSC:  03B45 03B35
Full Text:

### Completeness of S4 with respect to the real line: revisited. (English)Zbl 1066.03032

MSC:  03B45 06E25 54C10
Full Text:

### Communication leading to Nash equilibrium without acyclic condition. S4-knowledge model case. (English)Zbl 1102.91302

Bubak, Marian (ed.) et al., Computational science – ICCS 2004. 4th international conference, Kraków, Poland, June 6–9, 2004. Proceedings, Part IV. Berlin: Springer (ISBN 3-540-22129-8/pbk). Lecture Notes in Computer Science 3039, 884-891 (2004).
Full Text:

### The resolution method for one reducible class of formulas of the first-order modal logic S4. (English. Russian original)Zbl 1072.03011

Lith. Math. J. 44, No. 4, 386-394 (2004); translation from Liet. Mat. Rink. 44, No. 4, 481-492 (2004).
MSC:  03B35 03B45
Full Text:

### A proof-theoretic study of the correspondence of classical logic and modal logic. (English)Zbl 1056.03009

MSC:  03B45 03B10 03F03
Full Text:

### One calculus of nonderivable formulas of propositional modal logic. (English. Russian original)Zbl 1048.03015

Lith. Math. J. 43, No. 1, 56-66 (2003); translation from Liet. Mat. Rink 43, No. 1, 65-79 (2003).
MSC:  03B45
Full Text:

MSC:  03G30
Full Text:

Full Text:

### Labelled analytic tableaux for S4.3. (English)Zbl 1037.03013

MSC:  03B45 03B44

### Refutations, proofs, and models in the modal logic K4. (English)Zbl 0998.03017

MSC:  03B45 03B25 03F45
Full Text:

### Combined causal logics of Minkowski spacetime. (English)Zbl 1031.03040

Karpenko, A. S. (ed.), Logical investigations. 8. Papers from the 3rd international conference “Smirnov’s Readings”, Moscow, Russia, May 2001. Moskva: Nauka. 302-312 (2001).
MSC:  03B45 83A05 06C15

### Operations on proofs that can be specified by means of modal logic. (English)Zbl 1001.03055

Zakharyaschev, Michael (ed.) et al., Advances in modal logic. Vol. 2. Selected papers from the 2nd international workshop (AiML’98), Uppsala, Sweden, October 16-18, 1998. Stanford, CA: CSLI Publications. CSLI Lect. Notes. 119, 59-72 (2001).
MSC:  03F45 03B20 03B45

Full Text:

### Construction of an explicit basis for rules admissible in modal system S4. (English)Zbl 0992.03027

MSC:  03B45 03G25
Full Text:

Full Text:

### A resolution calculus for modal logic S4. (English)Zbl 1014.03024

MSC:  03B45 03B35

Full Text:

### On an intuitionistic modal logic. (English)Zbl 0963.03033

MSC:  03B45 03G30
Full Text:

### Two proof-theoretic remarks on EA+ECT. (English)Zbl 0964.03062

MSC:  03F50 03B45
Full Text:

Full Text:

### Aspects of refutation procedures in the intuitionistic logic and related modal systems. (English)Zbl 1025.03009

MSC:  03B20 03B45

### A completeness proof for propositional S4 in Cantor space. (English)Zbl 0923.03026

Orłowska, Ewa (ed.), Logic at work. Essays dedicated to the memory of Helena Rasiowa. Heidelberg: Physica-Verlag. Stud. Fuzziness Soft Comput. 24, 79-88 (1999).
Reviewer: L.F.Goble (Salem)
MSC:  03B45

### Explicit substitutions for constructive necessity. (English)Zbl 0949.03014

Larsen, Kim G. (ed.) et al., Automata, languages and programming. 25th international colloquium, ICALP ’98. Aalborg, Denmark, July 13-17, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1443, 743-754 (1998).
MSC:  03B40 68N18 03B70

### A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion. (English)Zbl 0908.03022

Nielsen, Mogens (ed.) et al., Computer science logic. 11th international workshop, CSL ’97. Annual conference of the EACSL, Aarhus, Denmark, August 23–29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1414, 275-294 (1998).
MSC:  03B40 03B45

### A polynomial translation of $$\text{S}4$$ into $$\text{T}$$ and contraction-free tableaux for $$\text{S}4$$. (English)Zbl 0869.03011

MSC:  03B45 03B35
Full Text:

### Representing the knowledge of Turing machines. (English)Zbl 0942.03514

Bacharach, M. O. L. (ed.) et al., Epistemic logic and the theory of games and decisions. Based on the conference, Marseille, France, January 1994. Dordrecht: Kluwer Academic Publishers. Theory Decis. Libr., Ser. C. 20, 169-190 (1997).

MSC:  03B45
Full Text:

### Refutations and proofs in S4. (English)Zbl 0867.03008

Wansing, Heinrich (ed.), Proof theory of modal logic. Proceedings of a workshop, Hamburg, Germany, November 19–20, 1993. Dordrecht: Kluwer Academic Publishers. Appl. Log. Ser. 2, 45-51 (1996).
Reviewer: L.F.Goble (Salem)
MSC:  03B45

### A linear approach to modal proof theory. (English)Zbl 0860.03017

Wansing, Heinrich (ed.), Proof theory of modal logic. Proceedings of a workshop, Hamburg, Germany, November 19–20, 1993. Dordrecht: Kluwer Academic Publishers. Appl. Log. Ser. 2, 33-43 (1996).
MSC:  03B45 03F05

### Transfer of sequent calculus strategies to resolution for S4. (English)Zbl 0869.03010

Wansing, Heinrich (ed.), Proof theory of modal logic. Proceedings of a workshop, Hamburg, Germany, November 19–20, 1993. Dordrecht: Kluwer Academic Publishers. Appl. Log. Ser. 2, 17-31 (1996).
Reviewer: N.Zamov (Kazan’)
MSC:  03B45 03B35

### A contraction-free sequent calculus for S4. (English)Zbl 0869.03012

Wansing, Heinrich (ed.), Proof theory of modal logic. Proceedings of a workshop, Hamburg, Germany, November 19–20, 1993. Dordrecht: Kluwer Academic Publishers. Appl. Log. Ser. 2, 3-15 (1996).
MSC:  03B45 03B35

### Sahlqvist formulas are not so elementary even above S4. (English)Zbl 0846.03004

Csirmaz, László (ed.) et al., Logic colloquium ’92, Veszprém, Hungary, August 9-15, 1992. Stanford, CA: CSLI Publications. Studies in Logic, Language and Computation. 61-73 (1995).
Reviewer: L.F.Goble (Salem)
MSC:  03B45 03B25

### Undefinability of propositional quantifiers in the modal system S4. (English)Zbl 0831.03008

MSC:  03B45 06E25 18C10
Full Text:

### On a modal lambda calculus for S4. (English)Zbl 0908.03018

Brookes, Steve (ed.) et al., Mathematical foundations of programming semantics. Proceedings of the 11th conference (MFPS), Tulane Univ., New Orleans, LA, USA, March 29 - April 1, 1995. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 1, 20 p. (1995).
Full Text:

### Convergence of positive schemes in S4 and Int. (English. Russian original)Zbl 0815.03009

Algebra Logic 33, No. 2, 95-101 (1994); translation from Algebra Logika 33, No. 2, 166-178 (1994).
MSC:  03B45
Full Text:

### A modal view of linear logic. (English)Zbl 0814.03038

Reviewer: S.Martini (Pisa)
Full Text:

### Representing the knowledge of Turing machines. (English)Zbl 0799.03028

MSC:  03B60 03D10 03B45
Full Text:

### Bases of admissible rules in modal logics S4.2 and S4.2Grz. (English. Russian original)Zbl 0813.03011

Algebra Logic 32, No. 2, 63-70 (1993); translation from Algebra Logika 32, No. 2, 117-130 (1993).
MSC:  03B45
Full Text:

### 2-sequent calculus: Intuitionism and natural deduction. (English)Zbl 0793.03013

Reviewer: G.Mints (Stanford)
MSC:  03B45
Full Text:

### Nonmonotonic reasoning is sometimes simpler. (English)Zbl 0793.68080

Gottlob, Georg (ed.) et al., Computational logic and proof theory. 3rd Kurt Gödel Colloquium, KGC ’93, Brno, Czech Republic, August 24-27, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 713, 313-324 (1993).

### A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics. (English)Zbl 0796.03016

MSC:  03B35 03B45
Full Text:

Full Text:

### The semantics of $$R4$$. (English)Zbl 0767.03010

Reviewer: L.F.Goble (Salem)
MSC:  03B47 03B45
Full Text:

MSC:  03B45

### Some type of formulas and the faithfulness of Flagg and Friedman’s translation. (English)Zbl 0762.03012

MSC:  03B45 03B10 03B20

### The first axiomatization of relevant logic. (English)Zbl 0767.03009

Reviewer: L.F.Goble (Salem)
MSC:  03B47 03-03 03B45
Full Text:

### The admissibility of $$\gamma$$ in R4. (English)Zbl 0767.03011

Reviewer: L.F.Goble (Salem)
MSC:  03B47 03B45
Full Text:

### Embedding a default system into nonmonotonic logics. (English)Zbl 0790.03025

MSC:  03B60 03B45 68T27

### Semantic admissibility criteria for deduction rules in S4 and Int. (English. Russian original)Zbl 0745.03016

Math. Notes 50, No. 1, 714-718 (1991); translation from Mat. Zametki 50, No. 1, 84-91 (1991).
MSC:  03B45 03B20
Full Text:

### A generalization of stability and its application to circumscription of positive introspective knowledge. (English)Zbl 0793.03020

Börger, Egon (ed.) et al., Computer science logic. 4th workshop, CSL ’90, Heidelberg, Germany, October 1-5, 1990. Proceedings. Berlin etc.: Springer-Verlag. Lect. Notes Comput. Sci. 533, 289-299 (1991).
MSC:  03B45 68T30

MSC:  03B45

### Semantic criteria for admissible inference rules in the logics S4 and Int. (Russian)Zbl 0729.03013

Reviewer: V.V.Rybakov
MSC:  03B45 03B20

### Ancestral Kripke models and nonhereditary Kripke models for the Heyting propositional calculus. (English)Zbl 0754.03008

MSC:  03B20 03B45 03C90
Full Text:

### On modal logics conservative over intuitionistic predicate calculus. (English. Russian original)Zbl 0784.03017

Mosc. Univ. Math. Bull. 46, No. 6, 58-61 (1992); translation from Vestn. Mosk. Univ., Ser. I 1991, No. 6, 86-90 (1991).
MSC:  03B45

### The disjunction property of intermediate propositional logics. (English)Zbl 0739.03016

MSC:  03B55 03B45
Full Text:

### A solution to a problem of Urquhart. (English)Zbl 0743.03012

Reviewer: L.F.Goble (Salem)
MSC:  03B45
Full Text:

MSC:  03B45

### Expressibility in propositional calculi. (Vyrazimost’ v ischisleniyakh vyskazyvanij.) (Russian)Zbl 0778.03001

Kishinev: Shtiintsa. 204 p. (1991).
Reviewer: G.Mints (Stanford)
MSC:  03-02 03B20 03B45

Full Text:

### The modal logic of pure provability. (English)Zbl 0713.03009

Reviewer: V.Shekhtman
MSC:  03B45 03F40 03B60
Full Text:

### Strategies for modal resolution: Results and problems. (English)Zbl 0709.03008

Reviewer: C.Masalagiu
MSC:  03B35 03B45 68T15
Full Text:

### Topological models of epistemic set theory. (English)Zbl 0704.03043

Reviewer: W.Veldman
Full Text:

### On Halldén-completeness of intermediate and modal logics. (English)Zbl 0698.03012

Reviewer: V.Shekhtman
MSC:  03B55 03B45 03B25

all top 5

all top 5

all top 3

all top 3