2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10

DOI10.2178/bsl/1305810915zbMath1215.03010OpenAlexW2504265904MaRDI QIDQ3011106

No author found.

Publication date: 28 June 2011

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/bsl/1305810915

Mathematics Subject Classification ID

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
• The strength of sharply bounded induction requires MSP
• The effective theory of Borel equivalence relations
• The algorithmic analysis of hybrid systems
• The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method
• Relation algebras by games
• Homomorphismes abstraits de groupes algébriques simples
• Homogeneity problems in the theory of Cech compactifications
• Abelsche \(p\)-Gruppen und ihre Automorphismengruppen
• Upward stability transfer for tame abstract elementary classes
• Compression schemes, stable definable families, and o-minimal structures
• Interpreting the arithmetic in Thompson's group \(F\).
• Menger's theorem for infinite graphs
• Categoricity in homogeneous complete metric spaces
• Logical structures and genus of proofs
• A cofinality-preserving small forcing may introduce a special Aronszajn tree
• Menger's theorem for countable graphs
• A Ramsey theorem for trees
• Proper forcing
• On the strength of König's duality theorem for infinite bipartite graphs
• Strong and weak constructivization and computable families
• The product of two reflection classes of the symmetric group
• Constructive models of \(\aleph_1\)-categorical theories
• Modal languages and bounded fragments of predicate logic
• A proof-theoretic analysis of collection
• Borel chromatic numbers
• Adding a temporal dimension to a logic system
• Computable models of theories with few models
• Proof-theoretic analysis by iterated reflection
• Computable structures and the hyperarithmetical hierarchy
• Ramsey methods in analysis
• OCA and automorphisms of \({\mathfrak P}(\omega)/\text{fin}\)
• Minimal temporal epistemic logic
• Categoricity in hyperarithmetical degrees
• Convex decompositions in the plane and continuous pair colorings of the irrationals
• Saturated models of universal theories
• Hybrid languages
• Parameter free induction and provably total computable functions
• Best solving modal equations
• A posteriori convergence in complete Boolean algebras with the sequential topology
• Definability and interpolation in non-classical logics
• Quotient topologies in constructive set theory and type theory
• Aristotle's syllogistic
• On a theorem of Schreier and Ulam for countable permutations
• Aspects of general topology in constructive set theory
• A model complete theory of valued D-fields
• SQUARES, SCALES AND STATIONARY REFLECTION
• Weak systems of determinacy and arithmetical quasi-inductive definitions
• A Borel reductibility theory for classes of countable structures
• Separating Classes of Groups by First-Order Sentences
• Interprétation de l'arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle
• Bounding non-GL₂ and R.E.A.
• Uniform regular enumerations
• ω-Degree Spectra
• The model theory of the field of reals with a subgroup of the unit circle
• Selection functions, bar recursion and backward induction
• Defining the set of integers in expansions of the real field by a closed discrete set
• Unifiability in extensions of K4
• Intuitionistic fuzzy logic and intuitionistic fuzzy set theory
• Relative recursive enumerability of generic degrees
• The relative efficiency of propositional proof systems
• Unification in intuitionistic logic
• On the strength of König's duality theorem for countable bipartite graphs
• Gauss decomposition with prescribed semisimple part in classical chevalley groups
• Accessible categories, saturation and categoricity
• Axioms which imply GCH
• On the induction schema for decidable predicates
• Model companions of theories with an automorphism
• Located sets and reverse mathematics
• The strict order property and generic automorphisms
• CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS
• Properties of forking in ω-free pseudo-algebraically closed fields
• The theory of modules of separably closed fields 1
• The torsionfree part of the Ziegler spectrum of RG when R is a Dedekind domain and G is a finite group
• Gauss decomposition with prescribed semisimple part in chevalley groups II exceptional cases
• A dichotomy for the definable universe
• Model theory of the Frobenius on the Witt vectors
• Comparing DNR and WWKL
• An Axiomatisation for the Multi-modal Logic of Knowledge and Linear Time LTK
• Post's Programme for the Ershov Hierarchy
• The  -Enumeration Degrees
• Complexity of Categorical Theories with Computable Models
• Nonstandard Arithmetic and Reverse Mathematics
• On the relationship between ATR₀ and
• Asymptotic cyclic expansion and bridge groups of formal proofs

This page was built for publication: 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10