Hostname: page-component-848d4c4894-mwx4w Total loading time: 0 Render date: 2024-07-05T03:08:58.899Z 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

Abstract

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).

Type
Paper
Copyright
2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)