Switch to: Citations

Add references

You must login to add references.
  1. Polynomial Time Uniform Word Problems.Stanley Burris - 1995 - Mathematical Logic Quarterly 41 (2):173-182.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Th. Skolem. Über gewisse “Verbände” oder “lattices.” Avhandlinger utgitt au Det Norske Videnskaps-Akademi i Oslo, I. Mat.-naturv. klasse 1936, no. 7 (1936), 16 pp. [REVIEW]Garrett Birkhoff & Th Skolem - 1937 - Journal of Symbolic Logic 2 (1):50-51.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Reviews. Oiva Ketonen. Untersuchungen zum Prädikatenkalkul. Annales Academiae Scientiarum Fennicae, series A, I. Mathematica-physica 23. Helsinki 1944, 71 pp. [REVIEW]Paul Bernays - 1945 - Journal of Symbolic Logic 10 (4):127-130.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • The axioms of constructive geometry.Jan von Plato - 1995 - Annals of Pure and Applied Logic 76 (2):169-200.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • Skolem's discovery of gödel-Dummett logic.Jan von Plato - 2003 - Studia Logica 73 (1):153 - 157.
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Skolem's Discovery of Gödel-Dummett Logic.Jan von Plato - 2003 - Studia Logica 73 (1):153-157.
    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.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Natural deduction with general elimination rules.Jan von Plato - 2001 - Archive for Mathematical Logic 40 (7):541-567.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   54 citations  
  • Contraction-free sequent calculi for geometric theories with an application to Barr's theorem.Sara Negri - 2003 - Archive for Mathematical Logic 42 (4):389-401.
    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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  • Decision methods for linearly ordered Heyting algebras.Sara Negri & Roy Dyckhoff - 2006 - Archive for Mathematical Logic 45 (4):411-422.
    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.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Some theorems about the sentential calculi of Lewis and Heyting.J. C. C. McKinsey & Alfred Tarski - 1948 - Journal of Symbolic Logic 13 (1):1-15.
  • Untersuchungen zum Prädikatenkalkul.Oiva Ketonen - 1945 - Journal of Symbolic Logic 10 (4):127-130.
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  • A propositional calculus with denumerable matrix.Michael Dummett - 1959 - Journal of Symbolic Logic 24 (2):97-106.