Works by Haeusler, E. H. (exact spelling)

Order:
  1.  55
    Proof Compression and NP Versus PSPACE.L. Gordeev & E. H. Haeusler - 2019 - Studia Logica 107 (1):53-83.
    We show that arbitrary tautologies of Johansson’s minimal propositional logic are provable by “small” polynomial-size dag-like natural deductions in Prawitz’s system for minimal propositional logic. These “small” deductions arise from standard “large” tree-like inputs by horizontal dag-like compression that is obtained by merging distinct nodes labeled with identical formulas occurring in horizontal sections of deductions involved. The underlying geometric idea: if the height, h(∂), and the total number of distinct formulas, ϕ(∂), of a given tree-like deduction ∂ of a minimal (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  2.  19
    Finitely many-valued logics and natural deduction.C. Englander, E. H. Haeusler & L. C. Pereira - 2014 - Logic Journal of the IGPL 22 (2):333-354.
  3.  18
    Propositional dynamic logic for Petri nets.B. Lopes, M. Benevides & E. H. Haeusler - 2014 - Logic Journal of the IGPL 22 (5):721-736.