The following pages link to Robert Veroff (Q220721):
Displaying 26 items.
- Double-negation elimination in some propositional logics (Q813082) (← links)
- Levi's commutator theorems for cancellative semigroups. (Q818943) (← links)
- Axiomatizing the skew Boolean propositional calculus (Q877820) (← links)
- Constructive logic with strong negation is a substructural logic. I (Q931408) (← links)
- Abelian logic and the logics of pointed lattice-ordered varieties (Q1001368) (← links)
- Constructive logic with strong negation is a substructural logic. II (Q1005940) (← links)
- Designing deductive databases (Q1104781) (← links)
- The linked inference principle. I: The formal treatment (Q1189727) (← links)
- A shortest 2-basis for Boolean algebra in terms of the Sheffer stroke (Q1431337) (← links)
- The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
- Short single axioms for Boolean algebra (Q1869610) (← links)
- Using hints to increase the effectiveness of an automated reasoning program: Case studies (Q1923820) (← links)
- Formalizing a fragment of combinatorics on words (Q2011632) (← links)
- A Wos Challenge Met (Q2102924) (← links)
- Yet another single law for lattices (Q2496167) (← links)
- Automated discovery of single axioms for ortholattices (Q2577711) (← links)
- (Q3433171) (← links)
- (Q3466619) (← links)
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic (Q4586423) (← links)
- A Geometric Procedure with Prover9 (Q4913864) (← links)
- Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction (Q4913865) (← links)
- (Q5293995) (← links)
- (Q5411478) (← links)
- (Q5505773) (← links)
- Finding shortest proofs: An application of linked inference rules (Q5951526) (← links)
- Solving open questions and other challenge problems using proof sketches (Q5951528) (← links)
