A New, Simpler Proof of the Modularisation Theorem for Logical Specifications

Logic Journal of the IGPL 1 (1):3-12 (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/1.1.3

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

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

A New, Simpler Proof Of The Modularisation Theorem For Logical Specifications.Paulo S. Veloso - 1993 - Logic Journal of the IGPL 1 (1):3-12.
A simpler proof of Jensen's coding theorem.Sy D. Friedman - 1994 - Annals of Pure and Applied Logic 70 (1):1-16.
An intuitionistic version of zermelo's proof that every choice set can be well-ordered.J. Todd Wilson - 2001 - Journal of Symbolic Logic 66 (3):1121-1126.
On a certain method of producing logical matrices.Zdzislaw Dywan - 1985 - Bulletin of the Section of Logic 14 (1):2-5.
A Simplified Proof of the Church–Rosser Theorem.Yuichi Komori, Naosuke Matsuda & Fumika Yamakawa - 2014 - Studia Logica 102 (1):175-183.
Poincaré vs. Russell on the rôle of logic in mathematicst.Michael Detlefsen - 1993 - Philosophia Mathematica 1 (1):24-49.
A note on Hjorth's oscillation theorem.Julien Melleray - 2010 - Journal of Symbolic Logic 75 (4):1359-1365.
Definition-like Extensions by Sorts.Claudia Maria & Paulo S. Veloso - 1995 - Logic Journal of the IGPL 3 (4):579-595.
We Can Be in Harmony With Classical Logic.Michael Gabbay - unknown
A simpler proof of Sahlqvist's theorem on completeness of modal logics.Giovanni Sambin - 1980 - Bulletin of the Section of Logic 9 (2):50-54.
Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters. [REVIEW]Pierluigi Minari - 2007 - Archive for Mathematical Logic 46 (5-6):385-424.
Every computably enumerable random real is provably computably enumerable random.Cristian Calude & Nicholas Hay - 2009 - Logic Journal of the IGPL 17 (4):351-374.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Proof-theoretic semantic values for logical operators.Nissim Francez & Gilad Ben-avi - 2011 - Review of Symbolic Logic 4 (3):466-478.
Gleason's theorem has a constructive proof.Fred Richman - 2000 - Journal of Philosophical Logic 29 (4):425-431.

Analytics

Added to PP
2016-06-30

Downloads
26 (#577,276)

6 months
7 (#350,235)

Historical graph of downloads
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