The proof of L-decidability of Lewis' system S5

&
Bulletin of the Section of Logic 1 (1):32-34 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,347

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Proof of ł-decidability of Lewis system S.Jerzy Słupecki & Grzegorz Bryll - 1973 - Studia Logica 32 (1):99 - 107.
An elementary system as and its semi‐completeness and decidability.Qin Jun - 1992 - Mathematical Logic Quarterly 38 (1):305-320.
Hybrid counterfactual logics David Lewis meets Arthur prior again.Katsuhiko Sano - 2009 - Journal of Logic, Language and Information 18 (4):515-539.
On the decidability of the PVD class with equality.N. Peltier - 2001 - Logic Journal of the IGPL 9 (4):569-592.
On the decidability of implicational ticket entailment.Katalin Bimbó & J. Michael Dunn - 2013 - Journal of Symbolic Logic 78 (1):214-236.
Dynamic Tableaux for Dynamic Modal Logics.Jonas De Vuyst - 2013 - Dissertation, Vrije Universiteit Brussel
Toward A Visual Proof System: Lewis Carroll’s Method of Trees.Francine F. Abeles - 2012 - Logica Universalis 6 (3-4):521-534.
Decidability in Intuitionistic Type Theory is Functionally Decidable.Silvio Valentini - 1996 - Mathematical Logic Quarterly 42 (1):300-304.
On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. [REVIEW]Carlos Caleiro, Luca Viganò & Marco Volpe - 2013 - Logica Universalis 7 (1):33-69.
Paraconsistent logics included in Lewis’ S4.Gemma Robles & José M. Méndez - 2010 - Review of Symbolic Logic 3 (3):442-466.
On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation.Mojżesz Presburger & Dale Jabcquette - 1991 - History and Philosophy of Logic 12 (2):225-233.
Extracting BB′IW Inhabitants of Simple Types From Proofs in the Sequent Calculus $${LT_\to^{t}}$$ L T → t for Implicational Ticket Entailment.Katalin Bimbó & J. Michael Dunn - 2014 - Logica Universalis 8 (2):141-164.
Decidability ofstit theory with a single agent andrefref equivalence.Ming Xu - 1994 - Studia Logica 53 (2):259 - 298.

Analytics

Added to PP
2015-02-02

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references