On the crispness of and arithmetic with a bisimulation in a constructive naive set theory

Logic Journal of the IGPL 22 (3):482-493 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,369

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Curry's paradox in contractionless constructive logic.Akama Seiki - 1996 - Journal of Philosophical Logic 25 (2):135 - 150.
A bisimulation characterization for interpretability logic.T. Perkov & M. Vukovi - 2014 - Logic Journal of the IGPL 22 (6):872-879.
Rudimentary and arithmetical constructive set theory.Peter Aczel - 2013 - Annals of Pure and Applied Logic 164 (4):396-415.
Interpreting classical theories in constructive ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.
Transfinite Cardinals in Paraconsistent Set Theory.Zach Weber - 2012 - Review of Symbolic Logic 5 (2):269-293.
Transfinite numbers in paraconsistent set theory.Zach Weber - 2010 - Review of Symbolic Logic 3 (1):71-92.

Analytics

Added to PP
2016-06-30

Downloads
21 (#1,013,103)

6 months
7 (#730,543)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Non-Well-Founded Sets.Peter Aczel - 1988 - Palo Alto, CA, USA: Csli Lecture Notes.
The undecidability of grisin's set theory.Andrea Cantini - 2003 - Studia Logica 74 (3):345 - 368.
On arithmetic in the Cantor- Łukasiewicz fuzzy set theory.Petr Hájek - 2005 - Archive for Mathematical Logic 44 (6):763-782.

Add more references