2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
From MaRDI portal
Publication:5305554
DOI10.2178/bsl/1264433799zbMath1182.03004OpenAlexW2977923888MaRDI QIDQ5305554
No author found.
Publication date: 22 March 2010
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1264433799
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametrized partitions of products of finite sets
- An analysis of first-order logics of probability
- Degrees of orderings not isomorphic to recursive linear orderings
- A closer look at constraints as processes
- A rate of convergence for asymptotic contractions
- Formal reasoning with rough sets in multiple-source approximation systems
- What is a non-truth-functional logic?
- Proof mining in topological dynamics
- Overspill and fragments of arithmetic
- On some examples of upper semilattices of computable enumerations
- Agreeing to disagree
- Elimination of Skolem functions for monotone formulas in analysis
- An \(\aleph_1\)-dense ideal on \(\aleph_2\)
- The axiom of determinacy, forcing axioms, and the nonstationary ideal
- A knowledge based semantics of messages
- On negation: Pure local rules
- Generic pairs of SU-rank 1 structures
- Proof mining in \(L_{1}\)-approximation
- Souslin partitions of products of finite sets
- A first-order axiomatization of the theory of finite trees
- Strong jump-traceability. I: The computably enumerable case
- Lowness properties and randomness
- Non-deterministic Multiple-valued Structures
- Canonical functions, non-regular ultrafilters and Ulam's problem on ω1
- Weak axioms of determinacy and subsystems of analysis I: δ20 games
- A new S4 classical modal logic in natural deduction
- Model Theoretic Complexity of Automatic Structures (Extended Abstract)
- Algorithmic Meta-theorems
- Ordinal Computability
- Reverse mathematics, computability, and partitions of trees
- Classifying model-theoretic properties
- Determinacy of Wadge classes and subsystems of second order arithmetic
- Preservation theorems for Kripke models
- Simplified morasses
- Countable approximations and Löwenheim-Skolem theorems
- Partitions of products
- A model-theoretic analysis of knowledge
- Compositional semantics for a language of imperfect information
- Some results on Kripke models over an arbitrary fixed frame
- Some logical metatheorems with applications in functional analysis
- On Overspill Principles and Axiom Schemes for Bounded Formulas
- Lowness for the class of random sets
- Kripke submodels and universal sentences
- Complete Theories with Finitely Many Countable Models. I
- Bounding prime models
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- η-representation of sets and degrees
- A characterization of the δ20 hyperhyperimmune sets
- On modal logic with propositional quantifiers
- Ramsey's theorem and recursion theory
- On the definition of negation by a fixed proposition in inferential calculus
- Theorem proving techniques for view deletion in databases
- Borel partitions of products of finite sets and the Ackermann function
This page was built for publication: 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
