A minimal logical system for computable concepts and effective knowability

Logique Et Analyse 34 (4):339-66 (1994)
  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: 92,410

External links

  • This entry has no external links. Add one.
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

In Defence of a Minimal Conception of Epistemic Contextualism: A Reply to M. D. Ashfield’s Response. [REVIEW]Wolfgang Freitag - 2013 - Acta Analytica 28 (1):127-137.
Computable Embeddings and Strongly Minimal Theories.J. Chisholm, J. F. Knight & S. Miller - 2007 - Journal of Symbolic Logic 72 (3):1031 - 1040.
Logical types in some arguments about knowability and belief.Bernard Linsky - 2009 - In Joe Salerno (ed.), New Essays on the Knowability Paradox. Oxford University Press.
The Church–Fitch knowability paradox in the light of structural proof theory.Paolo Maffezioli, Alberto Naibo & Sara Negri - 2012 - Synthese 190 (14):2677-2716.
A complete and consistent formal system for sortals.Max A. Freund - 2000 - Studia Logica 65 (3):367-381.
Parsimony hierarchies for inductive inference.Andris Ambainis, John Case, Sanjay Jain & Mandayam Suraj - 2004 - Journal of Symbolic Logic 69 (1):287-327.
More undecidable lattices of Steinitz exchange systems.L. R. Galminas & John W. Rosenthal - 2002 - Journal of Symbolic Logic 67 (2):859-878.
The computable dimension of trees of infinite height.Russell Miller - 2005 - Journal of Symbolic Logic 70 (1):111-141.
Computability and continuity in computable metric partial algebras equipped with computability structures.Fredrik Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4):486.
Stability of representations of effective partial algebras.Jens Blanck, Viggo Stoltenberg-Hansen & John V. Tucker - 2011 - Mathematical Logic Quarterly 57 (2):217-231.
Not every truth can be known (at least, not all at once).Greg Restall - 2009 - In Joe Salerno (ed.), New Essays on the Knowability Paradox. Oxford University Press. pp. 339--354.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.
A temporal logic for sortals.Max A. Freund - 2001 - Studia Logica 69 (3):351-380.

Analytics

Added to PP
2014-01-21

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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