THE -PROVABILITY LOGIC OF

2019 ◽  
Vol 84 (3) ◽  
pp. 1118-1135
Author(s):  
MOHAMMAD ARDESHIR ◽  
MOJTABA MOJTAHEDI
Keyword(s):  
Provability Logic ◽  
Modal Theory ◽  
Heyting Arithmetic ◽  
Image Position

AbstractFor the Heyting Arithmetic HA, $HA^{\text{*}} $ is defined [14, 15] as the theory $\left\{ {A|HA \vdash A^\square } \right\}$, where $A^\square $ is called the box translation of A (Definition 2.4). We characterize the ${\text{\Sigma }}_1 $-provability logic of $HA^{\text{*}} $ as a modal theory $iH_\sigma ^{\text{*}} $ (Definition 3.17).

PROVABILITY LOGICS RELATIVE TO A FIXED EXTENSION OF PEANO ARITHMETIC

2018 ◽  
Vol 83 (3) ◽  
pp. 1229-1246
Author(s):  
TAISHI KURAHASHI
Keyword(s):  
Peano Arithmetic ◽  
Provability Logic ◽  
Consistent Extension ◽  
Image Position ◽  
Computably Enumerable

AbstractLet T and U be any consistent theories of arithmetic. If T is computably enumerable, then the provability predicate $P{r_\tau }\left( x \right)$ of T is naturally obtained from each ${{\rm{\Sigma }}_1}$ definition $\tau \left( v \right)$ of T. The provability logic $P{L_\tau }\left( U \right)$ of τ relative to U is the set of all modal formulas which are provable in U under all arithmetical interpretations where □ is interpreted by $P{r_\tau }\left( x \right)$. It was proved by Beklemishev based on the previous studies by Artemov, Visser, and Japaridze that every $P{L_\tau }\left( U \right)$ coincides with one of the logics $G{L_\alpha }$, ${D_\beta }$, ${S_\beta }$, and $GL_\beta ^ -$, where α and β are subsets of ω and β is cofinite.We prove that if U is a computably enumerable consistent extension of Peano Arithmetic and L is one of $G{L_\alpha }$, ${D_\beta }$, ${S_\beta }$, and $GL_\beta ^ -$, where α is computably enumerable and β is cofinite, then there exists a ${{\rm{\Sigma }}_1}$ definition $\tau \left( v \right)$ of some extension of $I{{\rm{\Sigma }}_1}$ such that $P{L_\tau }\left( U \right)$ is exactly L.

scholarly journals STRONG COMPLETENESS OF PROVABILITY LOGIC FOR ORDINAL SPACES

2017 ◽  
Vol 82 (2) ◽  
pp. 608-628 ◽  
Author(s):  
JUAN P. AGUILERA ◽  
DAVID FERNÁNDEZ-DUQUE
Keyword(s):  
Initial Segment ◽  
Provability Logic ◽  
Strong Completeness ◽  
Scattered Space ◽  
The Family ◽  
Image Position ◽  
Special Case

AbstractGiven a scattered space $\mathfrak{X} = \left( {X,\tau } \right)$ and an ordinal λ, we define a topology $\tau _{ + \lambda } $ in such a way that τ+0 = τ and, when $\mathfrak{X}$ is an ordinal with the initial segment topology, the resulting sequence {τ+λ}λ∈Ord coincides with the family of topologies $\left\{ {\mathcal{I}_\lambda } \right\}_{\lambda \in Ord} $ used by Icard, Joosten, and the second author to provide semantics for polymodal provability logics.We prove that given any scattered space $\mathfrak{X}$ of large-enough rank and any ordinal λ > 0, GL is strongly complete for τ+λ. The special case where $\mathfrak{X} = \omega ^\omega + 1$ and λ = 1 yields a strengthening of a theorem of Abashidze and Blass.

Binary connectives functionally complete by themselves in S5 modal logic

1967 ◽  
Vol 32 (1) ◽  
pp. 91-92 ◽  
Author(s):  
Gerald J. Massey
Keyword(s):  
Modal Logic ◽  
Modal Theory ◽  
Binary Operator ◽  
Complete Set ◽  
Complete Sets ◽  
Image Position ◽  
Open Question ◽  
Truth Tables

This paper answers affirmatively the open question of Massey [1] concerning the existence of binary connectives functionally complete by themselves in two-valued truth tabular logic, i.e. in the modal theory S5. Since {∼, ⊃, ◊} is a functionally complete set of connectives (Massey [1, § 4]), the following definitions show that the binary operator ф, the semantics of which is given below, is functionally complete by itself: It is left to the reader to verify, by means of complete sets of truth tables (see Massey [1, §§ 1 and 3]), that the foregoing definitions are correct.

A note on Mathematics of infinity

1993 ◽  
Vol 58 (4) ◽  
pp. 1195-1200 ◽  
Author(s):  
Erik Palmgren
Keyword(s):  
Intuitionistic Logic ◽  
Type Theory ◽  
Natural Numbers ◽  
Disjunction Property ◽  
Recursive Functions ◽  
Choice Sequence ◽  
Heyting Arithmetic ◽  
Image Position

In the paper Mathematics of infinity, Martin-Löf extends his intuitionistic type theory with fixed “choice sequences”. The simplest, and most important instance, is given by adding the axiomsto the type of natural numbers. Martin-Löf's type theory can be regarded as an extension of Heyting arithmetic (HA). In this note we state and prove Martin-Löf's main result for this choice sequence, in the simpler setting of HA and other arithmetical theories based on intuitionistic logic (Theorem A). We also record some remarkable properties of the resulting systems; in general, these lack the disjunction property and may or may not have the explicit definability property. Moreover, they represent all recursive functions by terms.

scholarly journals RAMSEY’S THEOREM FOR PAIRS ANDKCOLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC

2017 ◽  
Vol 82 (2) ◽  
pp. 737-753
Author(s):  
STEFANO BERARDI ◽  
SILVIA STEILA
Keyword(s):  
Natural Number ◽  
Ramsey's Theorem ◽  
Recursively Enumerable ◽  
Ramsey’S Theorem ◽  
Heyting Arithmetic ◽  
Classical Principle ◽  
Image Position ◽  
Intuitionistic Arithmetic

AbstractThe purpose is to study the strength of Ramsey’s Theorem for pairs restricted to recursive assignments ofk-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number$k \ge 2$, Ramsey’s Theorem for pairs and recursive assignments ofkcolors is equivalent to the Limited Lesser Principle of Omniscience for${\rm{\Sigma }}_3^0$formulas over Heyting Arithmetic. Alternatively, the same theorem over intuitionistic arithmetic is equivalent to: for every recursively enumerable infinitek-ary tree there is some$i < k$and some branch with infinitely many children of indexi.

scholarly journals COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS

2019 ◽  
Vol 12 (3) ◽  
pp. 487-535
Author(s):  
WESLEY H. HOLLIDAY ◽  
TADEUSZ LITAK
Keyword(s):  
Modal Logic ◽  
Propositional Calculus ◽  
Provability Logic ◽  
Modal Algebras ◽  
Naturally Occurring ◽  
Bimodal Logic ◽  
Incompleteness Theorems ◽  
Image Position ◽  
Classical Propositional Calculus ◽  
Open Question

AbstractIn this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem (1979), “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class ofcompletely additivemodal algebras, or as we call them,${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question in the negative. In addition, for the case of bimodal logic, we show that there is a naturally occurring logic that is incomplete with respect to${\cal V}$-baos, namely the provability logic$GLB$(Japaridze, 1988; Boolos, 1993). We also show that even logics that are unsound with respect to such algebras do not have to be more complex than the classical propositional calculus. On the other hand, we observe that it is undecidable whether a syntactically defined logic is${\cal V}$-complete. After these results, we generalize the Blok Dichotomy (Blok, 1978) to degrees of${\cal V}$-incompleteness. In the end, we return to van Benthem’s theme of syntactic aspects of modal incompleteness.

A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property

1974 ◽  
Vol 39 (1) ◽  
pp. 67-78 ◽  
Author(s):  
D. M. Gabbay ◽  
D. H. J. De Jongh
Keyword(s):  
Intuitionistic Logic ◽  
Finite Model ◽  
Ordered Sets ◽  
Disjunction Property ◽  
University Of Illinois ◽  
Finite Model Property ◽  
Intermediate Logics ◽  
Heyting Arithmetic ◽  
Image Position ◽  
System 1

The intuitionistic propositional logic I has the following (disjunction) property.We are interested in extensions of the intuitionistic logic which are both decidable and have the disjunction property. Systems with the disjunction property are known, for example the Kreisel-Putnam system [1] which is I + (∼ϕ → (ψ ∨ α))→ ((∼ϕ→ψ) ∨ (∼ϕ→α)) and Scott's system I + ((∼ ∼ϕ→ϕ)→(ϕ ∨ ∼ϕ))→ (∼∼ϕ ∨ ∼ϕ). It was shown in [3c] that the first system has the finite-model property.In this note we shall construct a sequence of intermediate logics Dn with the following properties:These systems are presented both semantically and syntactically, using the remarkable correspondence between properties of partially ordered sets and axiom schemata of intuitionistic logic. This correspondence, apart from being interesting in itself (for giving geometric meaning to intuitionistic axioms), is also useful in giving independence proofs and obtaining proof theoretic results for intuitionistic systems (see for example, C. Smorynski, Thesis, University of Illinois, 1972, for independence and proof theoretic results in Heyting arithmetic).

Simple Identification of Electron Diffraction Ring Patterns

1969 ◽  
Vol 27 ◽  
pp. 160-161
Author(s):  
Carolyn Nohr ◽  
Ann Ayres
Keyword(s):  
Electron Microscope ◽  
Electron Diffraction ◽  
Diffraction Ring ◽  
Image Position

Texts on electron diffraction recommend that the camera constant of the electron microscope be determine d by calibration with a standard crystalline specimen, using the equation

Atomic orientation effects in proton stopping at low velocity

1983 ◽  
Vol 41 ◽  
pp. 708-709
Author(s):  
Kin Lam
Keyword(s):  
Polycrystalline Material ◽  
Charged Particles ◽  
Target Material ◽  
Stopping Power ◽  
Low Velocity ◽  
Electronic Density ◽  
Interatomic Distances ◽  
Frame Work ◽  
Image Position ◽  
Atomic Orientation

The energy of moving ions in solid is dependent on the electronic density as well as the atomic structural properties of the target material. These factors contribute to the observable effects in polycrystalline material using the scanning ion microscope. Here we outline a method to investigate the dependence of low velocity proton stopping on interatomic distances and orientations.The interaction of charged particles with atoms in the frame work of the Fermi gas model was proposed by Lindhard. For a system of atoms, the electronic Lindhard stopping power can be generalized to the formwhere the stopping power function is defined as

A Magnetic Spectrometer for a Scanning Transmission Electron Microscope

1974 ◽  
Vol 32 ◽  
pp. 436-437
Author(s):  
A. Kosiara ◽  
J. W. Wiggins ◽  
M. Beer
Keyword(s):  
Scanning Transmission Electron Microscope ◽  
Magnetic Spectrometer ◽  
Fringe Field ◽  
Curvature Radius ◽  
Magnetic Pole ◽  
Quadrupole Field ◽  
Transmission Electron ◽  
Scanning Transmission ◽  
Under Construction ◽  
Image Position

A magnetic spectrometer to be attached to the Johns Hopkins S. T. E. M. is under construction. Its main purpose will be to investigate electron interactions with biological molecules in the energy range of 40 KeV to 100 KeV. The spectrometer is of the type described by Kerwin and by Crewe Its magnetic pole boundary is given by the equationwhere R is the electron curvature radius. In our case, R = 15 cm. The electron beam will be deflected by an angle of 90°. The distance between the electron source and the pole boundary will be 30 cm. A linear fringe field will be generated by a quadrupole field arrangement. This is accomplished by a grounded mirror plate and a 45° taper of the magnetic pole.

Sign in / Sign up

Export Citation Format

Share Document