The following pages link to First-order modal tableaux (Q1104913):
Displaying 33 items.
- The undecidability of simultaneous rigid E-unification (Q671659) (← links)
- A logic for reasoning with inconsistency (Q688558) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- A tableau-like proof procedure for normal modal logics (Q1329745) (← links)
- Resolution theorem proving in reified modal logics (Q1332644) (← links)
- Accelerating tableaux proofs using compact representations (Q1334905) (← links)
- Cut-free sequent and tableau systems for propositional Diodorean modal logics (Q1337606) (← links)
- The liberalized \(\delta\)-rule in free variable semantic tableaux (Q1344882) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- On the intuitionistic force of classical search (Q1575923) (← links)
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\). (Q1854375) (← links)
- LotrecScheme (Q2825417) (← links)
- (Q3509041) (← links)
- Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems (Q4032915) (← links)
- Relations between propositional normal modal logics: an overview (Q4365323) (← links)
- A description of the tableau method using abstract state machines (Q4365324) (← links)
- lean TAP revisited (Q4399512) (← links)
- MGTP: A model generation theorem prover — Its advanced features and applications — (Q4610311) (← links)
- Free variable tableaux for propositional modal logics (Q4610317) (← links)
- Hintikka multiplicities in matrix decision methods for some propositional modal logics (Q4610320) (← links)
- Labelling ideality and subideality (Q4632306) (← links)
- A simple tableau system for the logic of elsewhere (Q4645235) (← links)
- On the intuitionistic force of classical search (Extended abstract) (Q4645244) (← links)
- Theorem Provers For Every Normal Modal Logic (Q4645724) (← links)
- Proof-terms for classical and intuitionistic resolution (Q4647497) (← links)
- Building decision procedures for modal logics from propositional decision procedures — The case study of modal K (Q4647549) (← links)
- Uniform and non uniform strategies for tableaux calculi for modal logics (Q4835516) (← links)
- Tableau calculus for local cubic modal logic and its implementation (Q4934884) (← links)
- The Tableau Workbench (Q4982114) (← links)
- Strongly analytic tableaux for normal modal logics (Q5210808) (← links)
- Labelled proofs for quantified modal logic (Q5235254) (← links)
- On the modal logic K plus theories (Q6560175) (← links)
- Reasoning with preorders and dynamic sorts using free variable tableaux (Q6560387) (← links)
