The following pages link to Matthias Baaz (Q167059):
Displaying 50 items.
- Methods of cut-elimination (Q609451) (← links)
- First-order satisfiability in Gödel logics: an NP-complete fragment (Q650893) (← links)
- Gentzen calculi for the existence predicate (Q817698) (← links)
- Generalizing proofs in monadic languages (with a postscript by Georg Kreisel). (Q930260) (← links)
- CERES: An analysis of Fürstenberg's proof of the infinity of primes (Q944367) (← links)
- Note on witnessed Gödel logics with Delta (Q1035647) (← links)
- Kripke-type semantics for Da Costa's paraconsistent logic \(C_{\omega}\) (Q1090674) (← links)
- Complexity of resolution proofs and function introduction (Q1194246) (← links)
- Note on generalizing theorems in algebraically closed fields (Q1267838) (← links)
- Cut normal forms and proof complexity (Q1302302) (← links)
- Completeness of a first-order temporal logic with time-gaps (Q1350524) (← links)
- Labeled calculi and finite-valued logics (Q1580658) (← links)
- Embedding logics into product logic (Q1580660) (← links)
- On the classification of first order Gödel logics (Q1616771) (← links)
- First-order interpolation of non-classical logics derived from propositional interpolation (Q1687562) (← links)
- Ten problems in Gödel logic (Q1699740) (← links)
- A sequent-calculus based formulation of the extended first epsilon theorem (Q1709688) (← links)
- Gödel logics with monotone operators (Q1759702) (← links)
- Interpolation in fuzzy logic (Q1818593) (← links)
- Resolution-based theorem proving for many-valued logics (Q1897558) (← links)
- Generalizing theorems in real closed fields (Q1899140) (← links)
- Note on the generalization of calculations (Q1960415) (← links)
- The number of axioms (Q2120967) (← links)
- Andrews Skolemization may shorten resolution proofs non-elementarily (Q2151391) (← links)
- A globally sound analytic calculus for Henkin quantifiers (Q2177584) (← links)
- First-order interpolation derived from propositional interpolation (Q2193292) (← links)
- Cut-elimination: syntax and semantics (Q2259012) (← links)
- Note on globally sound analytic calculi for quantifier macros (Q2303611) (← links)
- Finite-valued semantics for canonical labelled calculi (Q2351396) (← links)
- First-order Gödel logics (Q2370370) (← links)
- Monotone operators on Gödel logic (Q2449851) (← links)
- Towards a clausal analysis of cut-elimination (Q2457341) (← links)
- Herbrand's theorem and term induction (Q2491080) (← links)
- The Skolemization of existential quantifiers in intuitionistic logic (Q2503404) (← links)
- Controlling witnesses (Q2566063) (← links)
- Towards a proof theory for quantifier macros (Q2672659) (← links)
- (Q2721191) (← links)
- Normal form transformations (Q2751356) (← links)
- Automated deduction for many-valued logics (Q2751372) (← links)
- (Q2753673) (← links)
- (Q2767023) (← links)
- A natural deduction system for intuitionistic fuzzy logic (Q2784584) (← links)
- Proof theory of witnessed Gödel logic: a negative result (Q2804319) (← links)
- Cut Elimination for Gödel Logic with an Operator Adding a Constant (Q2820683) (← links)
- Theorem proving for prenex Gödel logic with \(\Delta\): checking validity and unsatisfiability (Q2881087) (← links)
- On the complexity of proof deskolemization (Q2892685) (← links)
- Effective Finite-Valued Semantics for Labelled Calculi (Q2908477) (← links)
- Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving (Q2996163) (← links)
- (Q2998380) (← links)
- (Q3001091) (← links)
