Results 31 to 40 of about 86 (68)

Connexive Exclusion. [PDF]

Erkenntnis
Shramko Y, Wansing H.
europepmc   +1 more source

On Logical and Scientific Strength. [PDF]

Erkenntnis
Incurvati L, Nicolai C.
europepmc   +1 more source

A Modal Analysis of Some Principles of the Provability Logic of Heyting Artihmetic.

, 1998
Besides the well-known principles K, K4 and L, the Leivant principle (AVВ)→ (AVB) and the Formalized Markov scheme  ¬¬ (A→ VBi) → (A→ VВi) are principles of the Provability Logic of (intuitionistic) Heyting Arithmetic. In this paper they are studied from a modal logical point of view.
openaire   +4 more sources

Evaluation, provably deductive equivalence in Heyting's arithmetic of substitution instances of propositional formulas

, 1985
This paper contains the following results: (i) a theorem of the form: if HA (Heyting's Arithmetic) proves some Σ01 substitution instance of an intuitionistically non valid propositional formula then HA proves a substitution instance of a simpler intuitionistically non-valid formula - unless of course the original formula was - in some appropriate sense
openaire   +1 more source

Some Remarks on a Difference between Gentzen's Finitist and Heyting's Intuitionist Approaches toward Intuitionistic Logic and Arithmetic

Annals of the Japan Association for Philosophy of Science, 2008
openaire   +2 more sources

Review: Wolfgang Burr, Fragments of Heyting Arithmetic

, 2002
openaire   +1 more source

A parametrised functional interpretation of Heyting arithmetic [PDF]

Annals of Pure and Applied Logic, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paulo Oliva, Bruno Dinis
exaly   +4 more sources

Uniform Heyting arithmetic

Annals of Pure and Applied Logic, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ulrich Berger
exaly   +4 more sources