共 50 条
- [1] Lindstrom theorems for fragments of first-order logic 22ND ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2007, : 280 - +
- [3] Weak cardinality theorems for first-order logic FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2003, 2751 : 400 - 411
- [4] Combinatorial Proofs and Decomposition Theorems for First-order Logic 2021 36TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2021,
- [6] Model checking the first-order fragment of higher-order fixpoint logic LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2007, 4790 : 62 - +
- [7] First-Order Logic Formalisation of Impossibility Theorems in Preference Aggregation Journal of Philosophical Logic, 2013, 42 : 595 - 618
- [9] Connecting Higher-Order Separation Logic to a First-Order Outside World PROGRAMMING LANGUAGES AND SYSTEMS ( ESOP 2020): 29TH EUROPEAN SYMPOSIUM ON PROGRAMMING, 2020, 12075 : 428 - 455
- [10] How to represent opaque sentences in first order logic 1600, Morgan Kaufmann Publ Inc, San Mateo, CA, USA (01):