The following pages link to Yury Savateev (Q392293):
Displayed 12 items.
- Proof internalization in generalized Frege systems for classical logic (Q392294) (← links)
- Product-free Lambek calculus is NP-complete (Q408532) (← links)
- Unidirectional Lambek grammars in polynomial time (Q987373) (← links)
- Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs (Q1685937) (← links)
- Cut elimination for the weak modal Grzegorczyk logic via non-well-founded proofs (Q2303617) (← links)
- Deciding FO-definability of regular languages (Q2695357) (← links)
- Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645) (← links)
- Product-Free Lambek Calculus Is NP-Complete (Q3605542) (← links)
- NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC (Q5001550) (← links)
- Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic (Q6080274) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
- Cut Elimination for Weak Modal Grzegorczyk Logic via Non-Well-Founded Proofs (Q6299945) (← links)