The following pages link to (Q4289327):
Displaying 40 items.
- Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\) (Q545319) (← links)
- On partial and paraconsistent logics (Q701297) (← links)
- Complexity issues in Basic Logic (Q816857) (← links)
- Equilibrium logic (Q854969) (← links)
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
- Giles's game and the proof theory of Łukasiewicz logic (Q1037588) (← links)
- A framework for automated reasoning in multiple-valued logics (Q1272603) (← links)
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers (Q1697332) (← links)
- Optimal axiomatizations of finitely valued logics (Q1854378) (← links)
- Many-valued logic and mixed integer programming (Q1924752) (← links)
- Unranked fuzzy logic and reasoning (Q2086405) (← links)
- Analytic tableaux for non-deterministic semantics (Q2142063) (← links)
- Hypersequent and display calculi -- a unified perspective (Q2259013) (← links)
- MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions (Q2282273) (← links)
- The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
- Automated theorem proving by resolution in non-classical logics (Q2385426) (← links)
- Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach (Q2679583) (← links)
- Automated deduction for many-valued logics (Q2751372) (← links)
- A Modal-Layered Resolution Calculus for K (Q3455770) (← links)
- Latticed Simulation Relations and Games (Q3510804) (← links)
- CWA Extensions to Multi-Valued Logics (Q3647206) (← links)
- An Algebraic Method to Decide the Deduction Problem in Many-Valued Logics (Q4236072) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- (Q4314600) (← links)
- (Q4360105) (← links)
- On Theorem Proving in Annotated Logics (Q4443407) (← links)
- Tableaux for logic programming with strong negation (Q4610313) (← links)
- MUltlog 1.0: Towards an expert system for many-valued logics (Q4647516) (← links)
- The tableau-based theorem prover 3 T A P Version 4.0 (Q4647529) (← links)
- Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices (Q4647557) (← links)
- A mechanization of strong Kleene logic for partial functions (Q5210785) (← links)
- Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis (Q5215504) (← links)
- Temporal reasoning over linear discrete time (Q5236442) (← links)
- Effective Finite-Valued Approximations of General Propositional Logics (Q5452176) (← links)
- Quantified Equilibrium Logic and Foundations for Answer Set Programs (Q5504679) (← links)
- \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\) (Q5946276) (← links)
- MaxSAT resolution for regular propositional logic (Q6066845) (← links)
- Epimorphism between Fine and Ferguson’s Matrices for Angell’s AC (Q6107288) (← links)
- Bisequent calculus for four-valued quasi-relevant logics: cut elimination and interpolation (Q6149588) (← links)
- Bilattice tableau calculi with rough set semantics (Q6623867) (← links)
