Abstract
A logical systemBM + is proposed, which, is a prepositional calculus enlarged with prepositional quantifiers and with two modal signs, □ and Δ These modalities are submitted to a finite number of axioms. □ is the usual sign of necessity, Δ corresponds to transmutation of a property (to be white) into the abstract property (to be the whiteness). An imbeddingσ of the usual theory of classesM intoBM + is constructed, such that a formulaA is provable inM if and only ifσ(A) is provable inBM +. There is also an inverse imbeddingπ with an analogous property.
Similar content being viewed by others
References
A. Tarski,Logic, Semantics, Metamathematics, Oxford, 1956.
K. Fine,Propositional quantifiers in modal logic,Theoria 36 (1970), pp. 336–346.
A. Morse,A theory of sets, Academic Press, N.-Y., 1965.
A. Mostowski,Constructible sets with applications, Amsterdam, 1969.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dishkant, H. Set theory as modal logic. Stud Logica 39, 335–345 (1980). https://doi.org/10.1007/BF00713543
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00713543