Weak Arithmetics and Kripke Models

In the first section of this paper we show that i Π₁ ≡ W⌝⌝lΠ₁ and that a Kripke model which decides bounded formulas forces iΠ₁ if and only if the union of the worlds in any (complete) path in it satisflies IΠ₁. In particular, the union of the worlds in any path of a Kripke model of HA models IΠ₁. In the second section of the paper, we show that for equivalence of forcing and satisfaction of Π_m‐formulas in a linear Kripke model deciding Δ₀‐formulas it is necessary and sufficient that the model be Σ_m‐elementary. This implies that if a linear Kripke model forces PEM_prenex, then it forces PEM. We also show that, for each n ≥ 1, iΦ_n does not prove ℋ︁(IΠ_n's are Burr's fragments of HA.     

Corrigendum to “Weak Arithmetics and Kripke Models”

We give a corrected proof of the main result in the paper [2] mentioned in the title. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the structure of kripke models of heyting arithmetic

Since in Heyting Arithmetic (HA) all atomic formulas are decidable, a Kripke model for HA may be regarded classically as a collection of classical structures for the language of arithmetic, partially ordered by the submodel relation. The obvious question is then: are these classical structures models of Peano Arithmetic (PA)? And dually: if a collection of models of PA, partially ordered by the submodel relation, is regarded as a Kripke model, is it a model of HA? Some partial answers to these questions were obtained in [6], [3], [1] and [2]. Here we present some results in the same direction, announced in [7]. In particular, it is proved that the classical structures at the nodes of a Kripke model of HA must be models of IΔ₁ (PA^- with induction for provably Δ₁ formulas) and that the relation between these classical structures must be that of a Δ₁-elementary submodel. MSC: 03F30, 03F55.     

Boolean deductive systems of BL-algebras

BL-algebras rise as Lindenbaum algebras from many valued logic introduced by Hájek [2]. In this paper Boolean ds and implicative ds of BL-algebras are defined and studied. The following is proved to be equivalent: (i) a ds D is implicative, (ii) D is Boolean, (iii) L/D is a Boolean algebra. Moreover, a BL-algebra L contains a proper Boolean ds iff L is bipartite. Local BL-algebras, too, are characterized. These results generalize some theorems presented in [4], [5], [6] for MV-algebras which are BL-algebras fulfiling an additional double negation law x = x ^**. Received: 22 June 1998 /?Published online: 18 May 2001     

A note on Spector's quantifier-free rule of extensionality

In this note we show that the so-called weakly extensional arithmetic in all finite types, which is based on a quantifier-free rule of extensionality due to C. Spector and which is of significance in the context of G?del"s functional interpretation, does not satisfy the deduction theorem for additional axioms. This holds already for Π⁰ ₁-axioms. Previously, only the failure of the stronger deduction theorem for deductions from (possibly open) assumptions (with parameters kept fixed) was known. Received: 11 March 1999 / Published online: 21 December 2000     

The spectrum of partitions of a Boolean algebra

The main notion dealt with in this article is

Trees and Keislers problem

We give a new negative solution to Keisler's problem regarding Skolem functions and elementary extensions. In contrast to existing ad hoc solutions due to Payne, Knight, and Lachlan, our solution uses well-known models. Received: 20 September 1999 / Published online: 21 March 2001     

Preservation theorems for Kripke models

There are several ways for defining the notion submodel for Kripke models of intuitionistic first‐order logic. In our approach a Kripke model A is a submodel of a Kripke model B if they have the same frame and for each two corresponding worlds A^α and B^α of them, A^α is a subset of B^α and forcing of atomic formulas with parameters in the smaller one, in A and B, are the same. In this case, B is called an extension of A. We characterize theories that are preserved under taking submodels and also those that are preserved under taking extensions as universal and existential theories, respectively. We also study the notion elementary submodel defined in the same style and give some results concerning this notion. In particular, we prove that the relation between each two corresponding worlds of finite Kripke models A ≤ B is elementary extension (in the classical sense) (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Subintuitionistic logics and the implications they prove

This is an investigation of the implications of IPC which remain provable when one weakens intuitionistic logic in various ways. The research is concerned with logics with Kripke models as introduced by G. Corsi in 1987, and others like G. Restall, Do?en, Visser. This leads to conservativity results for IPC with regard to classes of implications in some of these logics. Moreover, similar results are reached for some weaker subintuitionistic systems with neighborhood models introduced by the authors in 2016. In addition, the relationship between two types of neighborhood models introduced in that work is clarified. This clarification leads also to modal companions for weaker logics.     

Diophantine definability over non-finitely generated non-degenerate modules of algebraic extensions of ℚ

We investigate the issues of Diophantine definability over the non-finitely generated version of non-degenerate modules contained in the infinite algebraic extensions of the rational numbers. In particular, we show the following. Let k be a number field and let K _inf be a normal algebraic, possibly infinite, extension of k such that k has a normal extension L linearly disjoint from K _inf over k. Assume L is totally real and K _inf is totally complex. Let M _inf be a non-degenerate O _k -module, possibly non-finitely generated and contained in O _Kinf . Then M _inf contains a submodule Mˉ _inf such that M _inf /Mˉ _inf is torsion and O _k has a Diophantine definition over Mˉ _inf . Received: 4 May 1999 / Published online: 21 March 2001     

Preservativity logic: An analogue of interpretability logic for constructive theories

In this paper we study the modal behavior of Σ‐preservativity, an extension of provability which is equivalent to interpretability for classical superarithmetical theories. We explain the connection between the principles of this logic and some well‐known properties of HA, like the disjunction property and its admissible rules. We show that the intuitionistic modal logic given by the preservativity principles of HA known so far, is complete with respect to a certain class of frames.     

The Semantic Completeness of a Global Intuitionistic Logic

In this paper we will study a formal system of intuitionistic modal predicate logic. The main result is its semantic completeness theorem with respect to algebraic structures. At the end of the paper we will also present a brief consideration of its syntactic relationships with some similar systems.     

Local limit theorems for transition densities of Markov chains converging to diffusions

We consider triangular arrays of Markov chains that converge weakly to a diffusion process. Local limit theorems for transition densities are proved. Received: 28 August 1998 / Revised version: 6 September 1999 / Published online: 14 June 2000     

On the polynomial-space completeness of intuitionistic propositional logic

We present an alternative, purely semantical and relatively simple, proof of the Statman's result that both intuitionistic propositional logic and its implicational fragment are PSPACE-complete.This paper was supported by grant 401/01/0218 of the Grant Agency of the Czech Republic. % Mathematics Subject Classification (2000):     

On the limit laws of the second order for additive functionals of Harris recurrent Markov chains

Let {X _n } _{n ≥0} be a Harris recurrent Markov chain with state space E and invariant measure π. The law of the iterated logarithm and the law of weak convergence are given for the additive functionals of the form

Independence results for weak systems of intuitionistic arithmetic

This paper proves some independence results for weak fragments of Heyting arithmetic by using Kripke models. We present a necessary condition for linear Kripke models of arithmetical theories which are closed under the negative translation and use it to show that the union of the worlds in any linear Kripke model of HA satisfies PA. We construct a two‐node PA‐normal Kripke structure which does not force iΣ₂. We prove i?₁ ? i?₁, i?₁ ? i?₁, iΠ₂ ? iΣ₂ and iΣ₂ ? iΠ₂. We use Smorynski's operation Σ′ to show HA ? lΠ₁.     

Functional monadic Heyting algebras

We show every monadic Heyting algebra is isomorphic to a functional monadic Heyting algebra. This solves a 1957 problem of Monteiro and Varsavsky [9]. Received May 18, 2001; accepted in final form October 18, 2001.