Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- Carlo Dalla Pozza & Claudio Garola (1995). A Pragmatic Interpretation of Intuitionistic Propositional Logic. Erkenntnis 43 (1):81 - 109.We construct an extension P of the standard language of classical propositional logic by adjoining to the alphabet of a new category of logical-pragmatic signs. The well formed formulas of are calledradical formulas (rfs) of P;rfs preceded by theassertion sign constituteelementary assertive formulas of P, which can be connected together by means of thepragmatic connectives N, K, A, C, E, so as to obtain the set of all theassertive formulas (afs). Everyrf of P is endowed with atruth value defined classically, and everyaf is endowed with ajustification value, defined in terms of the intuitive notion of proof and depending on the truth values of its radical subformulas. In this framework, we define the notion ofpragmatic validity in P and yield a list of criteria of pragmatic validity which hold under the assumption that only classical metalinguistic procedures of proof be accepted. We translate the classical propositional calculus (CPC) and the intuitionistic propositional calculus (IPC) into the assertive part of P and show that this translation allows us to interpret Intuitionistic Logic as an axiomatic theory of the constructive proof concept rather than an alternative to Classical Logic. Finally, we show that our framework provides a suitable background for discussing classical problems in the philosophy of logic.Reading list | Discuss | Edit | Categorize |My bibliography
| Export citation | Other links: jstor.org | Scholar | At my library 
Similar books and articles
Provided here is a characterisation of absolute probability functions for intuitionistic (propositional) logic L, i.e. a set of constraints on the unary functions P from the statements of L to the reals, which insures that (i) if a statement A of L is provable in L, then P(A) = 1 for every P, L's axiomatisation being thus sound in the probabilistic sense, and (ii) if P(A) = 1 for every P, then A is provable in L, L's axiomatisation being thus complete in the probabilistic sense. As there are theorems of classical (propositional) logic that are not intuitionistic ones, there are unary probability functions for intuitionistic logic that are not classical ones. Provided here because of this is a means of singling out the classical probability functions from among the intuitionistic ones.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: springerlink.com dx.doi.org jstor.org | Scholar | At my library | More options ...
| | Other links: springerlink.com dx.doi.org jstor.org | Scholar | At my library | More options ... We introduce a logic BI in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version of BI arises from an analysis of the proof-theoretic relationship between conjunction and implication; it can be viewed as a merging of intuitionistic logic and multiplicative intuitionistic linear logic. The naturality of BI can be seen categorically: models of propositional BI's proofs are given by bicartesian doubly closed categories, i.e., categories which freely combine the semantics of propositional intuitionistic logic and propositional multiplicative intuitionistic linear logic. The predicate version of BI includes, in addition to standard additive quantifiers, multiplicative (or intensional) quantifiers ∀ new and ∃ new which arise from observing restrictions on structural rules on the level of terms as well as propositions. We discuss computational interpretations, based on sharing, at both the propositional and predicate levels.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: jstor.org | Scholar | At my library | More options ...
| | Other links: jstor.org | Scholar | At my library | More options ... A. Kuznetsov considered a logic which extended intuitionistic propositional logic by adding a notion of ''irreflexive modality''. We describe an extension of Kuznetsov''s logic having the following properties: (a) it is the unique maximal conservative (over intuitionistic propositional logic) extension of Kuznetsov''s logic; (b) it determines a new unary logical connective w.r.t. Novikov''s approach, i.e., there is no explicit expression within the system for the additional connective; (c) it is axiomatizable by means of one simple additional axiom scheme.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: springerlink.com dx.doi.org jstor.org | Scholar | At my library | More options ...
| | Other links: springerlink.com dx.doi.org jstor.org | Scholar | At my library | More options ... Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms. Modern categorical logic as well as the Kripke models of intuitionistic logic suggest that the interpretation of classical "propositional" logic might be the logic of subsets of a given universe set. The propositional interpretation is isomorphic to the special case where the truth and falsity of propositions behave like the subsets of a one-element set. If classical "propositional" logic is thus seen as the logic of subsets of a universe set, then the question naturally arises of a dual logic of partitions on a universe set. This paper is an introduction to that logic of partitions dual to classical "propositional" logic.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: journals.cambridge.org | Scholar | At my library | More options ...
| | Other links: journals.cambridge.org | Scholar | At my library | More options ... This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by. In full topological models * is not generally definable, but over Cantor-space and the reals it can be classically shown that; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order predicate logic.Over [0, 1], the operator * is (constructively and classically) undefinable. We show how to recast this argument in terms of intuitive intuitionistic validity in some parameter. The undefinability argument essentially uses the connectedness of [0, 1]; most of the work of recasting consists in the choice of a suitable intuitionistically meaningful parameter, so as to imitate the effect of connectedness.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: jstor.org | Scholar | At my library | More options ...
| | Other links: jstor.org | Scholar | At my library | More options ... We give a syntactic translation from first-order intuitionistic predicate logic into second-order intuitionistic propositional logic IPC2. The translation covers the full set of logical connectives ∧, ∨, →, ⊥, ∀, and ∃, extending our previous work, which studied the significantly simpler case of the universal-implicational fragment of predicate logic. As corollaries of our approach, we obtain simple proofs of nondefinability of ∃ from the propositional connectives and nondefinability of ∀ from ∃ in the second-order intuitionistic propositional logic. We also show that the ∀-free fragment of IPC2 is undecidable.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: dx.doi.org | Scholar | At my library | More options ...
| | Other links: dx.doi.org | Scholar | At my library | More options ... We study the monadic fragment of second order intuitionistic propositional logic in the language containing the standard propositional connectives and propositional quantifiers. It is proved that under the topological interpretation over any dense-in-itself metric space, the considered fragment collapses to Heyting calculus. Moreover, we prove that the topological interpretation over any dense-in-itself metric space of fragment in question coincides with the so-called Pitts' interpretation. We also prove that all the nonstandard propositional operators of the form q $\mapsto \exists$ p (q $\leftrightarrow$ F(p)), where F is an arbitrary monadic formula of the variable p, are definable in the language of Heyting calculus under the topological interpretation of intuitionistic logic over sufficiently regular spaces.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: jstor.org | Scholar | At my library | More options ...
| | Other links: jstor.org | Scholar | At my library | More options ... We define a propositionally quantified intuitionistic logic Hπ + by a natural extension of Kripke's semantics for propositional intutionistic logic. We then show that Hπ+ is recursively isomorphic to full second order classical logic. Hπ+ is the intuitionistic analogue of the modal systems S5π +, S4π +, S4.2π +, K4π +, Tπ +, Kπ + and Bπ +, studied by Fine.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: jstor.org | Scholar | At my library | More options ...
| | Other links: jstor.org | Scholar | At my library | More options ... We consider propositional operators defined by propositional quantification in intuitionistic logic. More specifically, we investigate the propositional operators of the formA* :p q(p A(q)) whereA(q) is one of the following formulae: (¬¬q q) V ¬¬q, (¬¬q q) (¬¬q V ¬q), ((¬¬q q) (¬¬q V ¬q)) ((¬¬q q) V ¬¬q). The equivalence ofA*(p) to ¬¬p is proved over the standard topological interpretation of intuitionistic second order propositional logic over Cantor space.We relate topological interpretations of second order intuitionistic propositional logic over Cantor space with the interpretation of propositional quantifiers (as the strongest and weakest interpolant in Heyting calculus) suggested by A. Pitts. One of the merits of Pitts' interpretation is shown to be valid for the interpretation over Cantor space.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: jstor.org | Scholar | At my library | More options ...
| | Other links: jstor.org | Scholar | At my library | More options ... We prove the following surprising property of Heyting's intuitionistic propositional calculus, IpC. Consider the collection of formulas, φ, built up from propositional variables (p,q,r,...) and falsity $(\perp)$ using conjunction $(\wedge)$ , disjunction (∨) and implication (→). Write $\vdash\phi$ to indicate that such a formula is intuitionistically valid. We show that for each variable p and formula φ there exists a formula Apφ (effectively computable from φ), containing only variables not equal to p which occur in φ, and such that for all formulas ψ not involving $p, \vdash \psi \rightarrow A_p\phi$ if and only if $\vdash \psi \rightarrow \phi$ . Consequently quantification over propositional variables can be modelled in IpC, and there is an interpretation of the second order propositional calculus, IpC2, in IpC which restricts to the identity on first order propositions. An immediate corollary is the strengthening of the usual interpolation theorem for IpC to the statement that there are least and greatest interpolant formulas for any given pair of formulas. The result also has a number of interesting consequences for the algebraic counterpart of IpC, the theory of Heyting algebras. In particular we show that a model of IpC2 can be constructed whose algebra of truth-values is equal to any given Heyting algebra.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: jstor.org | Scholar | At my library | More options ...
| | Other links: jstor.org | Scholar | At my library | More options ... Discussion of Carlo Dalla Pozza & Claudio Garola, A pragmatic interpretation of intuitionistic propositional logic
 Back
All discussions
Start a new thread
|
There are no threads in this forum |
Nothing in this forum yet.
