Implicational formulas in intuitionistic logic

1974 ◽  
Vol 39 (4) ◽  
pp. 661-664 ◽  
Author(s):  
Alasdair Urquhart
Keyword(s):  
Propositional Calculus ◽  
Modus Ponens ◽  
Equivalence Classes ◽  
Alternative Proof ◽  
Hilbert Algebra ◽  
Hilbert Algebras ◽  
Free Generators ◽  
Finite Set ◽  
Image Position ◽  
The Right

In [1] Diego showed that there are only finitely many nonequivalent formulas in n variables in the positive implicational propositional calculus P. He also gave a recursive construction of the corresponding algebra of formulas, the free Hilbert algebra In on n free generators. In the present paper we give an alternative proof of the finiteness of In, and another construction of free Hilbert algebras, yielding a normal form for implicational formulas. The main new result is that In is built up from n copies of a finite Boolean algebra. The proofs use Kripke models [2] rather than the algebraic techniques of [1].Let V be a finite set of propositional variables, and let F(V) be the set of all formulas built up from V ⋃ {t} using → alone. The algebra defined on the equivalence classes , by settingis a free Hilbert algebra I(V) on the free generators . A set T ⊆ F(V) is a theory if ⊦pA implies A ∈ T, and T is closed under modus ponens. For T a theory, T[A] is the theory {B ∣ A → B ∈ T}. A theory T is p-prime, where p ∈ V, if p ∉ T and, for any A ∈ F(V), A ∈ T or A → p ∈ T. A theory is prime if it is p-prime for some p. Pp(V) denotes the set of p-prime theories in F(V), P(V) the set of prime theories. T ∈ P(V) is minimal if there is no theory in P(V) strictly contained in T. Where X = {A1, …, An} is a finite set of formulas, let X → B be A1 →····→·An → B (ϕ → B is B). A formula A is a p-formula if p is the right-most variable occurring in A, i.e. if A is of the form X → p.

Note on a problem of Paul Bernays

1955 ◽  
Vol 20 (02) ◽  
pp. 109-114 ◽  
Author(s):  
Bolesław Sobociński
Keyword(s):  
Propositional Calculus ◽  
Modus Ponens ◽  
The Law ◽  
Image Position ◽  
Axiom Systems

In this Journal, vol. 18 (1953), p. 350 (Problem 7), Prof. P. Bernays proposed the following problem on propositional calculus: What is the smallest number n such that the propositional calculus, formulated with substitution and modus ponens as the only rules of inference, can be based on a set of initial formulas each of which contains at most n propositional letters (counted with multiplicity) ? In this note I give a solution to this problem, viz., that this number n = 5. For a system of propositional calculus in which the primitive functors are “C” (implication) and “N” (negation) and in which there are only two rules of inference, i.e. the rules of substitution and detachment (modus ponens), the following can be proved. (1) A set of propositional theses each of which contains at most 4 propositional letters is inadequate to give the complete bi-valued calculus of propositions. (2) There are axiom systems for this calculus in which each axiom contains at most 5 propositional letters. § 1. Consider the following normal metrix, in which the designated value is I: This satisfies the two rules of inference, and the following. (a) The law of commutation, i.e. the thesis CCpCqrCqCpr. (b) The following theses: Furthermore, in this matrix “N” is defined in such a way that: (c) For any well-formed formula α and any value m of this matrix, α = m if and only if NNα = m.

Formalisations of further ℵ0-valued Łukasiewicz propositional calculi

1978 ◽  
Vol 43 (2) ◽  
pp. 207-210 ◽  
Author(s):  
Alan Rose
Keyword(s):  
Propositional Calculus ◽  
Rational Numbers ◽  
Modus Ponens ◽  
Truth Values ◽  
Rules Of Procedure ◽  
C And N ◽  
Image Position ◽  
Propositional Calculi

It has been shown that, for all rational numbers r such that 0≤ r ≤ 1, the ℵ0-valued Łukasiewicz propositional calculus whose designated truth-values are those truth-values x such that r ≤ x ≤ 1 may be formalised completely by means of finitely many axiom schemes and primitive rules of procedure. We shall consider now the case where r is rational, 0≥r≤1 and the designated truth-values are those truth-values x such that r≤x≤1.We note that, in the subcase of the previous case where r = 1, a complete formalisation is given by the following four axiom schemes together with the rule of modus ponens (with respect to C),the functor A being defined in the usual way. The functors B, K, L will also be considered to be defined in the usual way. Let us consider now the functor Dαβ such that if P, Dαβ take the truth-values x, dαβ(x) respectively, α, β are relatively prime integers and r = α/β thenIt follows at once from a theorem of McNaughton that the functor Dαβ is definable in terms of C and N in an effective way. If r = 0 we make the definitionWe note first that if x ≤ α/β then dαβ(x)≤(β + 1)α/β − α = α/β. HenceLet us now define the functions dnαβ(x) (n = 0,1,…) bySinceit follows easily thatand thatThus, if x is designated, x − α/β > 0 and, if n > − log(x − α/β)/log(β + 1), then (β + 1)n(x−α/β) > 1.

Modus ponens under hypotheses

1965 ◽  
Vol 30 (1) ◽  
pp. 26-26 ◽  
Author(s):  
A. F. Bausch
Keyword(s):  
Mathematical Logic ◽  
Propositional Calculus ◽  
Modus Ponens ◽  
Inference Rules ◽  
Classical Calculus ◽  
New Formulation ◽  
Image Position ◽  
Classical Propositional Calculus

The Stoic “indemonstrables” were inference rules; a rule about rules was the synthetic theorem: if from certain premisses a conclusion follows and from that conclusion and certain further premisses a second conclusion follows, then the second conclusion follows from all the premisses together. Similar things occur as medieval “rules of consequence”, although not usually on a metametalevel; and (with the same proviso) the following might be deemed a contemporary avatar of that Stoic theorem.If every formula which occurs once or more often in the list A1, A2, …, An, B1, B2, …, Bm occurs also at least once in the list C1, C2, …, Cr then:This rule [Church: Introduction to Mathematical Logic, 1956, pp. 94, 165], which may be called the rule of modus ponens under hypotheses (MPH), is worthy of attention for the following reasons:A. MPH and the axioms A ⊃ A yield precisely the positive implicative calculus (and very easily, too).B. MPH and the axioms A ⊃ f ⊃ f ⊃ A yield a new formulation of the full classical propositional calculus (in terms of f and ⊃).C. MPH and the axioms ∼A ⊃ A ⊃ A and A ⊃. ∼A ⊃ B yield the classical calculus in terms of ∼ and ⊃.

Residual Gas Reactions in the Electron Microscope: I. Qualitative Observations on the Water Gas Reaction

1968 ◽  
Vol 26 ◽  
pp. 292-293
Author(s):  
Richard E. Hartman ◽  
Roberta S. Hartman ◽  
Peter L. Ramos
Keyword(s):  
Electron Beam ◽  
Electron Microscope ◽  
Gas Phase ◽  
Absolute Temperature ◽  
Residual Gas ◽  
Gas Reactions ◽  
Image Position ◽  
The Right ◽  
Water Gas ◽  
Thinning Rate

The action of water and the electron beam on organic specimens in the electron microscope results in the removal of oxidizable material (primarily hydrogen and carbon) by reactions similar to the water gas reaction .which has the form:The energy required to force the reaction to the right is supplied by the interaction of the electron beam with the specimen.The mass of water striking the specimen is given by:where u = gH2O/cm2 sec, PH2O = partial pressure of water in Torr, & T = absolute temperature of the gas phase. If it is assumed that mass is removed from the specimen by a reaction approximated by (1) and that the specimen is uniformly thinned by the reaction, then the thinning rate in A/ min iswhere x = thickness of the specimen in A, t = time in minutes, & E = efficiency (the fraction of the water striking the specimen which reacts with it).

scholarly journals Square-integrable representations of non-unimodular groups

1976 ◽  
Vol 15 (1) ◽  
pp. 1-12 ◽  
Author(s):  
A.L. Carey
Keyword(s):  
Hilbert Space ◽  
Reproducing Kernel ◽  
Reproducing Kernel Hilbert Space ◽  
Hilbert Algebra ◽  
Technical Tool ◽  
Integrable Representation ◽  
Hilbert Algebras ◽  
Orthogonality Relations ◽  
Square Integrable Representation ◽  
Main Technical Tool

In the last three years a number of people have investigated the orthogonality relations for square integrable representations of non-unimodular groups, extending the known results for the unimodular case. The results are stated in the language of left (or generalized) Hilbert algebras. This paper is devoted to proving the orthogonality relations without recourse to left Hilbert algebra techniques. Our main technical tool is to realise the square integrable representation in question in a reproducing kernel Hilbert space.

Post completeness in modal logic

1972 ◽  
Vol 37 (4) ◽  
pp. 711-715 ◽  
Author(s):  
Krister Segerberg
Keyword(s):  
Modal Logic ◽  
Upper Bound ◽  
Modus Ponens ◽  
Proper Subset ◽  
Proper Extension ◽  
Image Position

Let ⊥, →, and □ be primitive, and let us have a countable supply of propositional letters. By a (modal) logic we understand a proper subset of the set of all formulas containing every tautology and being closed under modus ponens and substitution. A logic is regular if it contains every instance of □A ∧ □B ↔ □(A ∧ B) and is closed under the ruleA regular logic is normal if it contains □⊤. The smallest regular logic we denote by C (the same as Lemmon's C2), the smallest normal one by K. If L and L' are logics and L ⊆ L′, then L is a sublogic of L', and L' is an extension of L; properly so if L ≠ L'. A logic is quasi-regular (respectively, quasi-normal) if it is an extension of C (respectively, K).A logic is Post complete if it has no proper extension. The Post number, denoted by p(L), is the number of Post complete extensions of L. Thanks to Lindenbaum, we know thatThere is an obvious upper bound, too:Furthermore,.

Navigating on the Information Highway

1994 ◽  
Vol 38 (4) ◽  
pp. 271-274 ◽  
Author(s):  
Arnold M. Lund
Keyword(s):  
Design Issues ◽  
Information Highway ◽  
Human Interface ◽  
Practical Design ◽  
Finite Set ◽  
Critical Problems ◽  
The Right ◽  
Time Frames ◽  
Theoretical Issues ◽  
Design Guidance

The “information highway” is being created now, and the design task is monumental. Some of the most critical problems in designing a navigation environment have never been addressed before, and developers are demanding that either we (as human interface designers) supply answers now or they will make up their own answers. There is too little time and there are too few resources to fully explore interesting theoretical issues, and yet the results of such exploration (if on the right topics) could be critically important. This paper will review some of the practical design issues that Ameritech has identified as being important in defining a navigation environment, and approaches we have taken to those design issues. These approaches have been shaped by a lack of design guidance in some areas, and a finite set of resources (especially time). The paper will also identify directions where research would be useful, and time frames during which the results will still be valuable.

Falconer's formula for the Hausdorff dimension of a self-affine set in R2

1995 ◽  
Vol 15 (1) ◽  
pp. 77-97 ◽  
Author(s):  
Irene Hueter ◽  
Steven P. Lalley
Keyword(s):  
Hausdorff Dimension ◽  
Dimensional Hausdorff Measure ◽  
Similarity Transformations ◽  
Affine Mappings ◽  
Finite Set ◽  
Self Similar ◽  
Image Position ◽  
Affine Set ◽  
Small Overlap ◽  
Box Dimensions

Let A1, A2,…,Ak be a finite set of contractive, affine, invertible self-mappings of R2. A compact subset Λ of R2 is said to be self-affine with affinitiesA1, A2,…,Ak ifIt is known [8] that for any such set of contractive affine mappings there is a unique (compact) SA set with these affinities. When the affine mappings A1, A2,…,Ak are similarity transformations, the set Λ is said to be self-similar. Self-similar sets are well understood, at least when the images Ai(Λ) have ‘small’ overlap: there is a simple and explicit formula for the Hausdorff and box dimensions [12, 10]; these are always equal; and the δ-dimensional Hausdorff measure of such a set (where δ is the Hausdorff dimension) is always positive and finite.

Register machine proof of the theorem on exponential diophantine representation of enumerable sets

1984 ◽  
Vol 49 (3) ◽  
pp. 818-829 ◽  
Author(s):  
J. P. Jones ◽  
Y. V. Matijasevič
Keyword(s):  
Natural Number ◽  
Polynomial Time ◽  
Simple Proof ◽  
Diophantine Equations ◽  
Polynomial Equation ◽  
Exponential Diophantine Equations ◽  
Recursively Enumerable ◽  
Image Position ◽  
The Right ◽  
Exponential Relation

The purpose of the present paper is to give a new, simple proof of the theorem of M. Davis, H. Putnam and J. Robinson [1961], which states that every recursively enumerable relation A(a1, …, an) is exponential diophantine, i.e. can be represented in the formwhere a1 …, an, x1, …, xm range over natural numbers and R and S are functions built up from these variables and natural number constants by the operations of addition, A + B, multiplication, AB, and exponentiation, AB. We refer to the variables a1,…,an as parameters and the variables x1 …, xm as unknowns.Historically, the Davis, Putnam and Robinson theorem was one of the important steps in the eventual solution of Hilbert's tenth problem by the second author [1970], who proved that the exponential relation, a = bc, is diophantine, and hence that the right side of (1) can be replaced by a polynomial equation. But this part will not be reproved here. Readers wishing to read about the proof of that are directed to the papers of Y. Matijasevič [1971a], M. Davis [1973], Y. Matijasevič and J. Robinson [1975] or C. Smoryński [1972]. We concern ourselves here for the most part only with exponential diophantine equations until §5 where we mention a few consequences for the class NP of sets computable in nondeterministic polynomial time.

scholarly journals The Chaetotaxy of the Pupa of Stegomyia fasciata

1920 ◽  
Vol 10 (2) ◽  
pp. 161-169 ◽  
Author(s):  
J. W. S. Macfie
Keyword(s):  
The Body ◽  
Posterior Angle ◽  
Image Position ◽  
The Right ◽  
Two Sides

The pupa is bilaterally symmetrical, that is, setae occur in similar situations on each side of the body, so that it will suffice to describe the arrangement on one side only. The setae on the two sides of the same pupa, however, often vary as regards their sub-divisions, and similar variations occur between different individuals; as an example, in Table I are shown some of the variations that were found in ten pupae taken at random. An examination of a larger number would have revealed a wider range. As a rule, a seta which is sometimes single, sometimes divided, is longer when single. For example, in one pupa the seta at the posterior angle ofthe seventh segment was single on the right side, double on the left; the former measuring 266μ, and the latter only 159μ in length. This fact is not specifically mentioned in the descriptions which follow, but should be understood.

Sign in / Sign up

Export Citation Format

Share Document