The following pages link to Edward Hermann Haeusler (Q281153):
Displayed 50 items.
- Extending propositional dynamic logic for Petri nets (Q281154) (← links)
- (Q529650) (redirect page) (← links)
- Defining effectiveness using finite sets. A study on computability (Q529651) (← links)
- Yet another bijection between sequent calculus and natural deduction (Q530853) (← links)
- A calculus for automatic verification of Petri nets based on resolution and dynamic logics (Q530854) (← links)
- (Q843602) (redirect page) (← links)
- Proof compressions with circuit-structured substitutions (Q843604) (← links)
- A note on the size of minimal covers (Q845985) (← links)
- Code migration and program maintainability -- A categorical perspective (Q1603495) (← links)
- (Q1744417) (redirect page) (← links)
- On strong normalization in proof-graphs for propositional logic (Q1744419) (← links)
- Towards reasoning about Petri nets: a propositional dynamic logic based approach (Q1786561) (← links)
- (Q2219083) (redirect page) (← links)
- Indexed and fibred structures for Hoare logic (Q2219084) (← links)
- A unified procedure for provability and counter-model generation in minimal implicational logic (Q2397231) (← links)
- How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning (Q2520659) (← links)
- Proof compression and NP versus PSPACE (Q2631644) (← links)
- (Q2735815) (← links)
- (Q2767190) (← links)
- Language-Oriented Formal Analysis: a Case Study on Protocols and Distributed Systems (Q2870335) (← links)
- (Q3075231) (← links)
- Mapping Modular SOS to Rewriting Logic (Q3079927) (← links)
- (Q3086711) (← links)
- Propositional Dynamic Logic for Petri Nets with Iteration (Q3179415) (← links)
- Action Algebras and Model Algebras in Denotational Semantics (Q3184749) (← links)
- (Q3781732) (← links)
- A formalization of Sambins's normalization for GL (Q4304806) (← links)
- A Concrete Categorical Model for the Lambek Syntactic Calculus (Q4333469) (← links)
- (Q4370280) (← links)
- (Q4438104) (← links)
- (Q4438121) (← links)
- (Q4487378) (← links)
- (Q4518817) (← links)
- Propositional dynamic logic for Petri nets (Q4644609) (← links)
- (Q4812325) (← links)
- Constructive Description Logics Hybrid-Style (Q4917077) (← links)
- (Q4918404) (← links)
- (Q4994969) (← links)
- (Q5013820) (← links)
- (Q5013887) (← links)
- (Q5039187) (← links)
- (Q5039194) (← links)
- DE ZOLT’S POSTULATE: AN ABSTRACT APPROACH (Q5065141) (← links)
- (Q5067946) (← links)
- (Q5116416) (← links)
- Proof Compression and NP Versus PSPACE II (Q5147748) (← links)
- A Topos-Theoretic Approach to Counterfactual Logic (Q5170289) (← links)
- Finitely many-valued logics and natural deduction (Q5176676) (← links)
- On Constructive Fragments of Classical Logic (Q5213615) (← links)
- On the Computability of Relations on λ-Terms and Rice’s Theorem - The Case of the Expansion Problem for Explicit Substitutions (Q5405040) (← links)