2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
From MaRDI portal
Publication:5421032
DOI10.2178/bsl/1185803808zbMath1119.03305OpenAlexW2287761954MaRDI QIDQ5421032
No author found.
Publication date: 22 October 2007
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.bsl/1185803808
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
- Computational complexity of the semantics of some natural language constructions
- A new spectrum of recursive models
- Handbook of philosophical logic. Vol. 8
- Theoretical computer science. Petri nets.
- Henkin quantifiers and complete problems
- \(\Delta^ 1_ 2\)-sets of reals
- Generic copies of countable structures
- On finite lattices which are embeddable in subsemigroup lattices
- Constructive models of \(\aleph_1\)-categorical theories
- Metamathematics of fuzzy logic
- Computable models of theories with few models
- Epsilon substitution method for \(\text{ID}_{1}(\Pi_{1}^{0}\vee{\Sigma} _{1}^{0})\)
- Hájek basic fuzzy logic and Łukasiewicz infinite-valued logic
- The computable enumerations of families of general recursive functions
- Notation systems for infinitary derivations
- Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL
- Fuzzy logics as the logics of chains
- Computable Boolean algebras
- Non-deterministic Multiple-valued Structures
- Algorithmic Randomness and Complexity
- Bounded Algebraic Geometry over a Free Lie Algebra
- The Pigeonhole Principle and Fragments of Arithmetic
- Algebraizable logics
- Quantifiers vs. Quantification Theory
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- Solovay-type characterizations for forcing-algebras
- S-Subsets of Natural Numbers
- Logical consecutions in discrete linear temporal logic
- Grundlagen der Mathematik I
- A note on Δ1induction and Σ1collection
- Effective model theory vs. recursive model theory
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
- Pseudo-finite dimensional representations of \(\text{sl}(2,k)\).
