2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07
From MaRDI portal
Publication:5387300
DOI10.2178/bsl/1208358849zbMath1134.03301OpenAlexW2488442884MaRDI QIDQ5387300
No author found.
Publication date: 8 May 2008
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1208358849
Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A descending chain condition for groups definable in o-minimal structures
- The structure of the models of decidable monadic theories of graphs
- All finitely axiomatizable tense logics of linear time flows are coNP-complete
- Techniques of constructive analysis
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- The p-adic spectrum
- A new recursion-theoretic characterization of the polytime functions
- Computably enumerable sets and quasi-reducibility
- Metamathematics of fuzzy logic
- CM-triviality and relational structures
- \(\aleph_0\)-categorical structures with a predimension
- Stability in geometric theories
- Elementary arithmetic
- Ultrafilters with small generating sets
- Equational bases for joins of residuated-lattice varieties
- Stable generic structures
- The lottery preparation
- On conjectures in orthocomplemented lattices
- On Schanuel's conjectures
- Lowness properties and randomness
- Construction of an Explicit Basis for Rules Admissible in Modal System S4
- Effective Borel measurability and reducibility of functions
- Outer models and genericity
- Generic sets in definably compact groups
- On witnessed models in fuzzy logic
- Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms
- Simplified morasses with linear limits
- Two Applications of Inductive Counting for Complementation Problems
- Anneaux p-adiquement clos et anneaux de fonctions définissables
- The cumulative hierarchy and the constructible universe of ZFA
- Complete Axiomatizations for Reasoning about Knowledge and Time
- TYPE-DEFINABILITY, COMPACT LIE GROUPS, AND o-MINIMALITY
- DEFINABLY COMPACT ABELIAN GROUPS
- Anneaux de fonctions p-adiques
- Admissible Inference Rules in the Linear Logic of Knowledge and Time LTK
- Logical consecutions in discrete linear temporal logic
- The Mordell-Lang conjecture for function fields
This page was built for publication: 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07