Pages that link to "Item:Q1047795"

The following pages link to Terminating tableau systems for hybrid logic with difference and converse (Q1047795):

Displaying 14 items.

• Completeness in hybrid type theory (Q484101) (← links)
• Lightweight hybrid tableaux (Q631086) (← links)
• Combining and automating classical and non-classical logics in classical higher-order logics (Q656826) (← links)
• Quantified multimodal logics in simple type theory (Q1945702) (← links)
• A prover dealing with nominals, binders, transitivity and relation hierarchies (Q2303237) (← links)
• Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
• A tableaux calculus for default intuitionistic logic (Q2305412) (← links)
• A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
• A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities (Q2351166) (← links)
• Extended decision procedure for a fragment of HL with binders (Q2351423) (← links)
• An efficient approach to nominal equalities in hybrid logic tableaux (Q2901189) (← links)
• A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders (Q3010363) (← links)
• Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners) (Q3058454) (← links)
• Terminating Tableaux for Hybrid Logic with Eventualities (Q5747764) (← links)