Pages that link to "Item:Q2996163"

The following pages link to Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving (Q2996163):

Displayed 16 items.

• The eskolemization of universal quantifiers (Q638487) ‎ (← links)
• A first order nonmonotonic extension of constructive logic (Q813086) ‎ (← links)
• Arithmetical complexity of fuzzy predicate logics -- a survey (Q816865) ‎ (← links)
• On the refutational completeness of signed binary resolution and hyperresolution (Q1037933) ‎ (← links)
• Ten problems in Gödel logic (Q1699740) ‎ (← links)
• The Skolemization of prenex formulas in intermediate logics (Q1740611) ‎ (← links)
• On the predicate logics of continuous t-norm BL-algebras (Q1765100) ‎ (← links)
• A proof-theoretical investigation of global intuitionistic (fuzzy) logic (Q1778065) ‎ (← links)
• Triangular norm based predicate fuzzy logics (Q2270233) ‎ (← links)
• Hyperresolution for Gödel logic with truth constants (Q2328910) ‎ (← links)
• First-order Gödel logics (Q2370370) ‎ (← links)
• Automated theorem proving by resolution in non-classical logics (Q2385426) ‎ (← links)
• A Generalisation of the Hyperresolution Principle to First Order Gödel Logic (Q2829667) ‎ (← links)
• Monadic Fragments of Gödel Logics: Decidability and Undecidability Results (Q3498458) ‎ (← links)
• Herbrand Theorems and Skolemization for Prenex Fuzzy Logics (Q3507415) ‎ (← links)
• SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability (Q3638278) ‎ (← links)