European Summer Meeting of the Association for Symbolic Logic

DOI10.2307/420948zbMath0925.03003OpenAlexW2310710763MaRDI QIDQ4837676

No author found.

Publication date: 26 July 1995

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

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0101-toc.htm

zbMATH Keywords

MeetingLogic ColloquiumSymbolic LogicKeele

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Differential equations in constructive analysis and in the recursive realizability topos
• Intensional mathematics
• Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
• Computable single-valued numerations
• Self-reference and modal logic
• A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
• Solving satisfiability in less than \(2^ n\) steps
• Primes and their residue rings in models of open induction
• A paradox regained
• The lattice of varieties of modal algebras is not strongly atomic
• A propositional logic with explicit fixed points
• Undecidability and incompleteness in classical mechanics
• Stable theories without dense forking chains
• Revision algebra semantics for conditional logic
• The way of the agent
• Normal bimodal logics of ability and action
• The joint embedding property in normal open induction
• Characterization of normal forms possessing inverse in the \(\lambda\)- \(\beta\)-\(\eta\)-calculus
• A propositional fragment of Lesniewski's ontology
• On the structure of semialgebraic sets over p-adic fields
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Gödel numberings of partial recursive functions
• On the logic of theory change: Partial meet contraction and revision functions
• Solution to the P − W problem
• Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
• Anneaux p-adiquement clos et anneaux de fonctions définissables
• Contraction-free sequent calculi for intuitionistic logic
• On Entailment
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• On the base-dependence of sets of numbers recognizable by finite automata

This page was built for publication: European Summer Meeting of the Association for Symbolic Logic