Review: Domenico Cantone, Alfredo Ferro, Eugenio Omodeo, Computable Set Theory [Book Review]

Journal of Symbolic Logic 58 (1):361-362 (1993)
  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: 91,349

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 decision procedure for monotone functions over bounded and complete lattices.Domenico Cantone & Calogero G. Zarba - 2006 - In Harrie de Swart, Ewa Orlowska, Gunther Smith & Marc Roubens (eds.), Theory and Applications of Relational Structures as Knowledge Instruments Ii. Springer. pp. 318--333.
The Bernays—Schönfinkel—Ramsey class for set theory: decidability.Alberto Policriti & Eugenio Omodeo - 2012 - Journal of Symbolic Logic 77 (3):896-918.
Review: Domenico Castaldo, Relazione fra le Funzioni Simmetriche in un Algebra di Boole. [REVIEW]Ruggero Ferro - 1971 - Journal of Symbolic Logic 36 (1):164-164.
Decidability of ∀*∀‐Sentences in Membership Theories.Eugenio G. Omodeo, Franco Parlamento & Alberto Policriti - 1996 - Mathematical Logic Quarterly 42 (1):41-58.
An environment for specifying properties of dyadic relations and reasoning about them II: relational presentation of non-classical logics.Andrea Formisano, Eugenio G. Omodeo & Ewa Orłowska - 2006 - In Harrie de Swart, Ewa Orlowska, Gunther Smith & Marc Roubens (eds.), Theory and Applications of Relational Structures as Knowledge Instruments Ii. Springer. pp. 89--104.
Review: Melvin Fitting, First-Order Logic and Automated Theorem Proving. [REVIEW]Alfredo Ferro - 1993 - Journal of Symbolic Logic 58 (2):719-719.
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability.Eugenio Omodeo & Alberto Policriti - 2010 - Journal of Symbolic Logic 75 (2):459-480.
Review: M. O. Rabin, Computable Algebraic Systems; Michael O. Rabin, Computable Algebra, General Theory and Theory of Computable Fields. [REVIEW]B. H. Mayoh - 1967 - Journal of Symbolic Logic 32 (3):412-413.
Three existence principles in a modal calculus without descriptions contained in A. Bressan's ${\rm MC}^\nu$.Eugenio Giovanni Omodeo - 1980 - Notre Dame Journal of Formal Logic 21 (4):711-727.
Dual tableau-based decision procedures for relational logics with restricted composition operator.Domenico Cantone, Marianna Nicolosi Asmundo & Ewa Orlowska - 2011 - Journal of Applied Non-Classical Logics 21 (2):177-200.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.
Área de Concentração: Gestão da Tecnologia e da Produção Orientador: Prof. Paulo Antônio Zawislak.Eugenio Avila Pedrozo & José Roberto Ferro - 2009 - Hermes 20:5.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.

Analytics

Added to PP
2013-11-22

Downloads
15 (#923,100)

6 months
1 (#1,510,037)

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