2002 Annual Conference of the Australasian Association for Logic

DOI10.1017/S1079898600004674zbMath1058.03502OpenAlexW4249325438MaRDI QIDQ4650308

No author found.

Publication date: 9 February 2005

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

Full work available at URL: https://projecteuclid.org/euclid.bsl/1052669296

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Domain theory in logical form
• Implementing the `Fool's model' of combinatory logic
• The semantics of entailment. III
• Reasoning about information change
• A symmetric lambda calculus for classical program extraction
• On the implication problem for cardinality constraints and functional dependencies
• A filter lambda model and the completeness of type assignment
• Classical negation can be expressed by one of its halves

This page was built for publication: 2002 Annual Conference of the Australasian Association for Logic