A constructive semantics for non-deducibility

Mathematical Logic Quarterly 54 (1):35-48 (2008)
  Copy   BIBTEX

Abstract

This paper provides a constructive topological semantics for non-deducibility of a first order intuitionistic formula. Formal topology theory, in particular the recently introduced notion of a binary positivity predicate, and co-induction are two needful tools

Categories

Keywords

Reprint years

DOI

10.1002/malq.200710026

Links

PhilArchive



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

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

On the formal points of the formal topology of the binary tree.Silvio Valentini - 2002 - Archive for Mathematical Logic 41 (7):603-618.
The problem of the formalization of constructive topology.Silvio Valentini - 2005 - Archive for Mathematical Logic 44 (1):115-129.
From sets and types to topology and analysis: towards practicable foundations for constructive mathematics.Laura Crosilla & Peter Schuster (eds.) - 2005 - New York: Oxford University Press.
Method of establishing deducibility in classical predicate calculus.G. V. Davydov - 1969 - In A. O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic. New York,: Consultants Bureau. pp. 1--4.
A solution to the surprise exam paradox in constructive mathematics.Mohammad Ardeshir & Rasoul Ramezanian - 2012 - Review of Symbolic Logic 5 (4):679-686.
Constructive mathematics in theory and programming practice.Douglas Bridges & Steeve Reeves - 1999 - Philosophia Mathematica 7 (1):65-104.
Objects: A Study in Kantian Formal Epistemology.Giovanni Boniolo & Silvio Valentini - 2012 - Notre Dame Journal of Formal Logic 53 (4):457-478.
Review: N. N. Vorob'ev, A New Algorithm of Deducibility in the Constructive Propositional Calculus. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):109-109.
Review: N. N. Vorob'ev, The Problem of Deducibility in the Constructive Propositional Calculus with Strong Negation. [REVIEW]Andrzej Mostowski - 1953 - Journal of Symbolic Logic 18 (3):258-258.
Natural Topology.Frank Waaldijk - 2012 - Brouwer Society.
Intentional mathematics.Stewart Shapiro (ed.) - 1985 - New YorK, N.Y., U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
On the foundations of constructive mathematics – especially in relation to the theory of continuous functions.Frank Waaldijk - 2004 - Foundations of Science 10 (3):249-324.
Why Topology in the Minimalist Foundation Must be Pointfree.Maria Emilia Maietti & Giovanni Sambin - 2013 - Logic and Logical Philosophy 22 (2):167-199.
Varieties of constructive mathematics.D. S. Bridges - 1987 - New York: Cambridge University Press. Edited by Fred Richman.

Analytics

Added to PP
2013-12-01

Downloads
9 (#1,130,089)

6 months
1 (#1,241,711)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A constructive investigation of satisfiability.Francesco Ciraulo - 2012 - Annals of Pure and Applied Logic 163 (2):111-121.

Add more citations

References found in this work

Inductively generated formal topologies.Thierry Coquand, Giovanni Sambin, Jan Smith & Silvio Valentini - 2003 - Annals of Pure and Applied Logic 124 (1-3):71-106.
Pretopologies and completeness proofs.Giovanni Sambin - 1995 - Journal of Symbolic Logic 60 (3):861-878.
Formal Zariski topology: positivity and points.Peter Schuster - 2006 - Annals of Pure and Applied Logic 137 (1-3):317-359.

Add more references