2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03

DOI10.1017/S1079898600004066zbMath1059.03507OpenAlexW131044794MaRDI QIDQ4678940

No author found.

Publication date: 24 May 2005

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

Full work available at URL: https://doi.org/10.1017/s1079898600004066

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some applications of computable one-one numberings
• Classification theory for non-elementary classes. I: The number of uncountable models of \(\psi \in L_{\omega _ 1,\omega}\)
• Some partition relations for ideals on \(P_{\kappa}\lambda\)
• The modal logic of provability. The sequential approach
• A game semantics for linear logic
• Decidability problems in languages with Henkin quantifiers
• Least fixed points in Grzegorczyk's logic and in the intuitionistic propositional logic
• Least fixed points in the Gödel-Löb logic
• Propositional lax logic
• Semantic analysis of orthologic
• Strongly minimal modules
• Many-dimensional modal logics: theory and applications
• Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
• Quantum logic in intuitionistic perspective
• Orbit cardinals: On the effective cardinalities arising as quotient spaces of the form \(X/G\) where \(G\) acts on a Polish space \(X\)
• Ordinal arithmetic and \(\Sigma_1\)-elementarity
• Untersuchungen über das logische Schliessen. II
• Discrete families of recursive functions and index sets
• Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe
• Church-Rosser property of a simple reduction for full first-order classical natural deduction
• An algorithm for handling many relational calculus queries efficiently.
• The logics of orthoalgebras
• Studies on the axiom of comprehension
• A model of set-theory in which every set of reals is Lebesgue measurable
• Inconsistent models of arithmetic Part II: the general case
• An axiomatics for nonstandard set theory, based on von Neumann–Bernays–Gödel Theory
• GALOIS GROUPS OF FIRST ORDER THEORIES
• The consistency problem for positive comprehension principles
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
• On the proof theory of the modal logic for arithmetic provability
• Grothendieck Topology as Geometric Modality
• Modal semantics without possible worlds
• Minimale Gruppen
• Adding a closed unbounded set
• European summer meeting of the Association for Symbolic Logic
• Fixpoint logics, relational machines, and computational complexity
• Products of modal logics, part 1
• An Ulm-type classification theorem for equivalence relations in Solovay model
• The diameter of a Lascar strong type
• An application of graphical enumeration to PA *
• Infinite time Turing machines
• μ-definable sets of integers
• Analytic natural deduction
• Hierarchies of Boolean algebras
• The classification of hypersmooth Borel equivalence relations
• Elementary patterns of resemblance
• Categoricity of an abstract elementary class in two successive cardinals

This page was built for publication: 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03