Attention is drawn to the fact that what is alternatively known as Dummett logic, Gödel logic, or Gödel-Dummett logic, was actually introduced by Skolem already in 1913. A related work of 1919 introduces implicative lattices, or Heyting algebras in today's terminology.

Geometric theories are presented as contraction- and cut-free systems of sequent calculi with mathematical rules following a prescribed rule-scheme that extends the scheme given in Negri and von Plato. Examples include cut-free calculi for Robinson arithmetic and real closed fields. As an immediate consequence of cut elimination, it is shown that if a geometric implication is classically derivable from a geometric theory then it is intuitionistically derivable.

The structure of derivations in natural deduction is analyzed through isomorphism with a suitable sequent calculus, with twelve hidden convertibilities revealed in usual natural deduction. A general formulation of conjunction and implication elimination rules is given, analogous to disjunction elimination. Normalization through permutative conversions now applies in all cases. Derivations in normal form have all major premisses of elimination rules as assumptions. Conversion in any order terminates.Through the condition that in a cut-free derivation of the sequent Γ⇒C, no inactive weakening (...) or contraction formulas remain in Γ, a correspondence with the formal derivability relation of natural deduction is obtained: All formulas of Γ become open assumptions in natural deduction, through an inductively defined translation. Weakenings are interpreted as vacuous discharges, and contractions as multiple discharges. In the other direction, non-normal derivations translate into derivations with cuts having the cut formula principal either in both premisses or in the right premiss only. (shrink)

The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable; a simple solution is here presented, inspired by related ideas in Gödel-Dummett logic.

Elementary geometry can be axiomatized constructively by taking as primitive the concepts of the apartness of a point from a line and the convergence of two lines, instead of incidence and parallelism as in the classical axiomatizations. I first give the axioms of a general plane geometry of apartness and convergence. Constructive projective geometry is obtained by adding the principle that any two distinct lines converge, and affine geometry by adding a parallel line construction, etc. Constructive axiomatization allows solutions to (...) geometric problems to be effected as computer programs. I present a formalization of the axiomatization in type theory. This formalization works directly as a computer implementation of geometry. (shrink)

We have two polynomial time results for the uniform word problem for a quasivariety Q: The uniform word problem for Q can be solved in polynomial time iff one can find a certain congruence on finite partial algebras in polynomial time. Let Q* be the relational class determined by Q. If any universal Horn class between the universal closure S and the weak embedding closure S̄ of Q* is finitely axiomatizable then the uniform word problem for Q is solvable in (...) polynomial time. This covers Skolem's 1920 solution to the uniform word problem for lattices and Evans' 1953 applications of the weak embeddability property for finite partial V algebras. (shrink)