共 50 条
- [2] On the computational complexity of decidable fragments of first-order linear temporal logics TIME-ICTL 2003: 10TH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING AND FOURTH INTERNATIONAL CONFERENCE ON TEMPORAL LOGIC, PROCEEDINGS, 2003, : 91 - 98
- [3] Craig Interpolation for Decidable First-Order Fragments FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PT II, FOSSACS 2024, 2024, 14575 : 137 - 159
- [6] Craig Interpolation for Decidable Fragments of First-Order Logic 32ND EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC, CSL 2024, 2024, 288
- [7] Decidable and Undecidable Fragments of First-Order Concatenation Theory SAILING ROUTES IN THE WORLD OF COMPUTATION, 2018, 10936 : 244 - 253
- [8] Combinations of Theories for Decidable Fragments of First-Order Logic FRONTIERS OF COMBINING SYSTEMS, PROCEEDINGS, 2009, 5749 : 263 - 278
- [9] Decidable and undecidable fragments of first-order branching temporal logics 17TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2002, : 393 - 402
- [10] Decidable ∃∗∀∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\exists }^*{\forall }^*$$\end{document} First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates Journal of Automated Reasoning, 2021, 65 (3) : 357 - 423