Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Axioms for Definability and Fu...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Axioms for Definability and Full Completeness
Bibliographic Details
Main Author:
Abramsky, S
Format:
Conference item
Published:
MIT Press
1999
Holdings
Description
Similar Items
Staff View
Similar Items
A program for the full axiom of choice
by: Jean-Louis Krivine
Published: (2021-09-01)
Concurrent Games and Full Completeness
by: Abramsky, S, et al.
Published: (1999)
Games and Full Completeness for Multiplicative Linear Logic
by: Abramsky, S, et al.
Published: (1994)
Games and Full Completeness for Multiplicative Linear Logic
by: Abramsky, S, et al.
Published: (1992)
Linear realizability and full completeness for typed lambda−calculi
by: Abramsky, S, et al.
Published: (2005)