Almost duplication-free tableau calculi for propositional lax logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1071, Issue , 1996, Pages 48-64

  Avellone, Alessandro ^a   Ferrari, Mauro ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Duplications; Intuitionistic modal logics; Refutation systems

Indexed keywords

BIOMINERALIZATION; C (PROGRAMMING LANGUAGE); CALCULATIONS; FORMAL LOGIC; PATHOLOGY; RECONFIGURABLE HARDWARE; SEMANTICS;

DUPLICATIONS; HARDWARE VERIFICATION; INTUITIONISTIC LOGIC; KRIPKE SEMANTICS; MODAL LOGIC; ONE-RULE; SOUNDNESS AND COMPLETENESS;

THEOREM PROVING;

EID: 21344474062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61208-4_4     Document Type: Conference Paper

References (16)

1. G. Amati and F. Pirri. A uniform tableau method for intuitionistic modal logics I*. Studia Logica, 53(1):29-60, 1994.
2. M. Bozic and K. Dosen. Models for normal intuitionistic modal logics. Studia Logica, 43:217-245, 1984.
3. M.J. Cresswell and G.E. Hughes. A Companion to Modal Logic. Methuen, 1984.
4. H.B. Curry. The elimination theorem when modality is present. The Journal of Symbolic Logic, 17:249-265, 1952.
5. M. Ferrari. Cut-free tableau calculi for some intuitionistie modal logics. Technical Report 133-95, Dipartimento di Scienze dell'Informazione, Universith degli Studi di Milan_9 1995.
6. M. Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordreeht, 1983.
7. M. Fairtlough and M. Mendler. An intuitionistic modal logic with applications to the formal verification of hardware. In LNCS Springer-Verlag, editor, Proceedings of Computer Science Logic "94, Kazimierz, Poland, pages 354-368, 1994.
8. G. Fischer Servi. On modal logics with an intuitionistic base. Studia Logica, 36:141-149, 1977.
9. G. Fischer Servi. Axiomatizations for some intuitionistie modal logics. Rend. Sem. Mat. Univers. Polit. Torino, 42:179-194, 1984.
10. D.M. Gabbay. Semantical Investigations in Heyting's Intuitionistic Logic. Reidel, Dordrecht, 1981.
11. M. Mendler. Constrained proofs: A logic for dealing with behavioural constraints in formal hardware verification. In G.Jones and M.Sheerml, editors, Designing Correct Circuits, pages 1-28. Springer, 1990.
12. M. Mendler. A Modal Logic for Handling Behavioural Constraints in Formal Hardware Verification. PhD thesis, Edinburgh University, Department of Computer Science, ECS-LFCS-93-255, 1993.
13. P. Miglioli, U. Moscato, and M. Ornaghi. How to avoid duplications in refutation systems for intuitionistie logic and Kuroda logic. In K. Broda, M. D' Agostino, R. Gore, R. Johnson, and S. Reeves, editors, Proceedings of the 3rd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 169-187. Abingdon, U.K., May 4-6 1994.
14. P Miglioli, U. Moscato, and M. Ornaghi. An improved refutation system for intuitionistic predicate logic. Journal of Automated Reasoning, 12:361-373, 1994.
15. G. Plotkin and C. Stifling. A framework for intuitionistic modal logic. In J.Y. Halpern, editor, Theoretical Aspects of Reasoning about Knowledge, pages 399-406. Morgan-Kaufmann, 1986.
16. A.S. Troelstra and D. van Dalen. Constructivism in mathematics: an introduction. Volunle 2. In Studies in logic and the foundations of mathematics, volume 122. North-Holland, 1988.