2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
From MaRDI portal
Publication:4678940
DOI10.1017/S1079898600004066zbMATH Open1059.03507OpenAlexW131044794MaRDI QIDQ4678940FDOQ4678940
Authors:
Publication date: 24 May 2005
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1079898600004066
Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Collections of abstracts of lectures (00B05)
Cites Work
- Many-dimensional modal logics: theory and applications
- Untersuchungen über das logische Schliessen. II
- A model of set-theory in which every set of reals is Lebesgue measurable
- Galois groups of first order theories
- The diameter of a Lascar strong type
- Title not available (Why is that?)
- Classification theory for non-elementary classes. I: The number of uncountable models of \(\psi \in L_{\omega _ 1,\omega}\)
- Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
- Categoricity of an abstract elementary class in two successive cardinals
- The modal logic of provability. The sequential approach
- Title not available (Why is that?)
- Products of modal logics, part 1
- The classification of hypersmooth Borel equivalence relations
- Semantic analysis of orthologic
- Studies on the axiom of comprehension
- Title not available (Why is that?)
- Title not available (Why is that?)
- Propositional lax logic
- Quantum logic in intuitionistic perspective
- Minimale Gruppen
- A game semantics for linear logic
- Infinite time Turing machines
- Inconsistent models of arithmetic. II: The general case
- Hierarchies of Boolean algebras
- On representing concepts in finite models
- Some partition relations for ideals on \(P_{\kappa}\lambda\)
- Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
- Ordinal arithmetic and \(\Sigma_1\)-elementarity
- Elementary patterns of resemblance
- Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe
- Grothendieck Topology as Geometric Modality
- Church-Rosser property of a simple reduction for full first-order classical natural deduction
- The logics of orthoalgebras
- The consistency problem for positive comprehension principles
- On the proof theory of the modal logic for arithmetic provability
- Some applications of computable one-one numberings
- An application of graphical enumeration to PA *
- Title not available (Why is that?)
- An algorithm for handling many relational calculus queries efficiently.
- On the slowly well orderedness of \(\varepsilon_0\)
- Discrete families of recursive functions and index sets
- Fixpoint logics, relational machines, and computational complexity
- Adding a closed unbounded set
- Analytic natural deduction
- An Ulm-type classification theorem for equivalence relations in Solovay model
- An axiomatics for nonstandard set theory, based on von Neumann-Bernays-Gödel theory
- Decidability problems in languages with Henkin quantifiers
- Modal semantics without possible worlds
- Title not available (Why is that?)
- μ-definable sets of integers
- Least fixed points in Grzegorczyk's logic and in the intuitionistic propositional logic
- Least fixed points in the Gödel-Löb logic
- Strongly minimal modules
- Title not available (Why is that?)
- Orbit cardinals: On the effective cardinalities arising as quotient spaces of the form \(X/G\) where \(G\) acts on a Polish space \(X\)
- European summer meeting of the Association for Symbolic Logic
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4678940)
