Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-07T19:50:04.069Z Has data issue: false hasContentIssue false

Classical logic as limit completion

Published online by Cambridge University Press:  28 January 2005

STEFANO BERARDI
Affiliation:
Computer Science Department, Università di Torino, Corso Svizzera 185, 10149 Torino, Italyhttp://www.di.unito.it/~stefano
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We define a constructive model for ${\Delta^0_2}$-maps, that is, maps recursively definable from a map deciding the halting problem. Our model refines an existing constructive interpretation for classical reasoning over one-quantifier formulas: it is compositional (Modus Ponens is interpreted as an application) and semantical (rather than translating classical proofs into intuitionistic ones, we define a mathematical structure intuitionistically validating excluded middle for one-quantifier formulas).

Information

Type
Paper
Copyright
2005 Cambridge University Press