<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2007-04-25 06:19:51Finite model theory Formal languages Computational complexity theory Descriptive complexity Model theory FO SO Free variables and bound variables Modal logic Logic Theoretical computer science Mathematical logic |
| workplace with digital tablet, notebook and coffee cupDocID: 1rpIg - View Document |
| Categorematic Unreducible Polyadic Quantifiers in Lexical Resource Semantics Frank Richter Goethe Universität Frankfurt a.M. HeadLex 2016, WarsawDocID: 1rjZ3 - View Document |
| A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby MartinDocID: 1rd10 - View Document |
| Integrating Categorematic Unreducible Polyadic Quantifiers in LRS Frank Richter∗ Introduction This paper has two goals: On the technical side, it presents a general integration of polyadic quantification in Lexical ResDocID: 1ratm - View Document |
| Model theory of finite and pseudofinite groups Dugald Macpherson∗, School of Mathematics, University of Leeds, Leeds LS2 9JT, UK,DocID: 1qU5n - View Document |