2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
From MaRDI portal
Publication:3616431
DOI10.2178/bsl/1231081772zbMath1156.03306OpenAlexW2278308630MaRDI QIDQ3616431
No author found.
Publication date: 25 March 2009
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1231081772
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
- Weak density and cupping in the d-r.e. degrees
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi
- Building discretely ordered Bezout domains and GCD domains
- A new strongly minimal set
- An axiomatic approach to self-referential truth
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Primes and their residue rings in models of open induction
- Topological dynamics and combinatorial number theory
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Domain theory in logical form
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Finite equational bases for finite algebras in a congruence-distributive equational class
- Full abstractness for a functional/concurrent language with higher-order value-passing
- Semantical analysis of perpetual strategies in \(\lambda\)-calculus
- Lambda-calculi for (strict) parallel functions
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Logic of proofs
- A fully abstract denotational model for higher-order processes
- Behavioural inverse limit \(\lambda\)-models
- A set of postulates for the foundation of logic
- Peirce's rule in natural deduction.
- Definable principal subcongruences.
- A set of postulates for the foundation of logic. II
- A system of complete and consistent truth
- Algebraic study of two deductive systems of relevance logic
- Large cardinals and definable counterexamples to the continuum hypothesis
- On the strength of Ramsey's theorem
- Combinatory logic. Vol. II
- Compositional characterisations of \(\lambda\)-terms using intersection types
- On the strength of Ramsey's theorem for pairs
- Explicit Provability and Constructive Semantics
- A recursive nonstandard model of normal open induction
- A theory of formal truth arithmetically equivalent to ID1
- Begründung einer strengen Implikation
- A filter lambda model and the completeness of type assignment
- The proof-theoretic analysis of transfinitely iterated quasi least fixed points
- Uniform regular enumerations
- What are logical notions?
- On the relation between choice and comprehension principles in second order arithmetic
- Bounded existential induction
- On the proof theory of the intermediate logic MH
- On cut elimination in the presence of perice rule
- A Filter Model for Concurrent $\lambda$-Calculus
- A filter model for mobile processes
- Effective versions of Ramsey's Theorem: Avoiding the cone above 0′
- Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
- Extending partial combinatory algebras
- The call-by-value λ-calculus: a semantic investigation
- Logicality and Invariance
- Epistemic Actions as Resources
- The -Enumeration Degrees
- Relativized Degree Spectra
- On Mathematical Induction
- Ramsey's theorem and recursion theory
- The completeness of the first-order functional calculus
- Logic, logics, and logicism
- Weak and strong theories of truth
- Logic of proofs and provability
