Pages that link to "Item:Q1066880"
From MaRDI portal
The following pages link to A decidable fragment of predicate calculus (Q1066880):
Displaying 23 items.
- Tractable fragments of Presburger arithmetic (Q814932) (← links)
- Predicate logics without the structure rules (Q1089330) (← links)
- Remarks on a survey article on many valued logic by A. Urquhart (Q1100190) (← links)
- A general method of axiomatizing fragments (Q1176090) (← links)
- A decision procedure revisited: Notes on direct logic, linear logic and its implementation (Q1186430) (← links)
- Decision problems for propositional linear logic (Q1192352) (← links)
- Semantics of weakening and contraction (Q1337357) (← links)
- Limited reasoning in first-order knowledge bases (Q1343837) (← links)
- Connection methods in linear logic and proof nets construction (Q1575926) (← links)
- Limited reasoning in first-order knowledge bases with full introspection (Q2171268) (← links)
- (Q3351351) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988 (Q3478381) (← links)
- On contraction and the modal fragment (Q3520225) (← links)
- Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials (Q3532470) (← links)
- Decidability properties for fragments of CHR (Q3585171) (← links)
- Automatic theorem proving. II (Q3793764) (← links)
- (Q4250044) (← links)
- Monadic Decomposition (Q4640286) (← links)
- Predicative Fragments of Frege Arithmetic (Q4678937) (← links)
- Causal dependencies in multiplicative linear logic with MIX (Q4862762) (← links)
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants (Q4917988) (← links)
- Decidable fragments of field theories (Q5202171) (← links)
- On the Methodology of Paraconsistent Logic (Q5213765) (← links)
