Pages that link to "Item:Q2385426"
From MaRDI portal
The following pages link to Automated theorem proving by resolution in non-classical logics (Q2385426):
Displaying 14 items.
- Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\) (Q545319) (← links)
- Internal axioms for domain semirings (Q627202) (← links)
- Combining and automating classical and non-classical logics in classical higher-order logics (Q656826) (← links)
- On the refutational completeness of signed binary resolution and hyperresolution (Q1037933) (← links)
- A case study in automated theorem proving: Finding sages in combinatory logic (Q1098333) (← links)
- Automated theorem proving in temporal logic: \(T\)-resolution (Q1322389) (← links)
- Resolution theorem proving (Q2751353) (← links)
- Distributive Lattice-Structured Ontologies (Q2888493) (← links)
- Modal Semirings Revisited (Q3521996) (← links)
- Reasoning Support for Casl with Automated Theorem Proving Systems (Q3591069) (← links)
- A resolution theorem prover for intuitionistic logic (Q4647496) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)
- Relative annihilators in bounded commutative residuated lattices (Q6107477) (← links)
- \(\mathcal{L}\)-fuzzy annihilators in residuated lattices (Q6180421) (← links)
