FVM Theorems for Counting Logic
by EScholar: Electronic Academic Papers for ScholarsMarch 21st, 2024
EScholar: Electronic Academic Papers for Scholars
@escholar
We publish the best academic work (that's too often lost...
Read this story in a terminal
Print this story
Read this story w/o Javascript
Too Long; Didn't Read
In this paper, we present a categorical theory of the composition methods in finite model theory – a key technique enabling modular reasoning.
1x
Read by Dr. One
Listen to this story
EScholar: Electronic Academic Papers for Scholars
@escholar
We publish the best academic work (that's too often lost to peer reviews & the TA's desk) to the global tech community
About @escholar
LEARN MORE ABOUT @ESCHOLAR'S
EXPERTISE AND PLACE ON THE INTERNET.
EXPERTISE AND PLACE ON THE INTERNET.
This paper is available on arxiv under CC BY-SA 4.0 DEED license.
Authors:
(1) Tomáš Jakl, Czech Academy of Sciences and Czech Technical University;
(2) Dan Marsden, School of Computer Science University of Nottingham;
(3) Nihil Shah, Department of Computer Science University of Oxford.
Table of Links
- Abstract & Introduction
- Prelimenaries
- FVM Theorems for Positive Existential Fragments
- FVM Theorems for Counting Logic
- FVM Theorems for The Full Logic
- Abstract FVM Theorems for Products
- Adding Equality and Other Enrichment
- Conclusions, Acknowledgments & References
- Appendix A FVM theorems for coproducts
- Appendix B Proofs Omitted from Section III
- Appendix C Proofs Omitted from Section IV
- Appendix D Proofs Omitted from Section V
- Appendix E Proofs Omitted from Section VI
- Appendix F Proofs Omitted from Section VII
IV. FVM THEOREMS FOR COUNTING LOGIC
We now consider another relationship induced by a game comonad. To do so, we first introduce one of the two standard categories associated with any comonad.
L O A D I N G
. . . comments & more!
. . . comments & more!
About Author
TOPICS
THIS ARTICLE WAS FEATURED IN...
RELATED STORIES
X REMOVE AD
