default search action
Michael Gabbay 0001
Person information
- affiliation: University of Cambridge, UK
- affiliation: King's College London, UK
Other persons with the same name
- Michael Gabbay 0002 — University of Washington, Seattle, USA
- Michael Gabbay 0003 — Information Systems Laboratories, Inc., San Diego, CA, USA
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j10]Michael Gabbay, Prokop Sousedík, David Svoboda:
Editorial. FLAP 5(6): 1259-1260 (2018) - [j9]Michael Gabbay:
Formalism and Set Theoretic Truth. FLAP 5(6): 1365-1380 (2018) - 2017
- [j8]Murdoch James Gabbay, Michael Gabbay:
Representation and duality of the untyped λ-calculus in nominal lattice and topological semantics, with a proof of topological completeness. Ann. Pure Appl. Log. 168(3): 501-621 (2017) - [j7]Michael Gabbay:
Bilateralism does not provide a proof theoretic treatment of classical logic (for technical reasons). J. Appl. Log. 25(Supplement): S108-S122 (2017) - 2016
- [j6]Dov M. Gabbay, Michael Gabbay:
Theory of disjunctive attacks, Part I. Log. J. IGPL 24(2): 186-218 (2016) - [j5]Dov M. Gabbay, Michael Gabbay:
The attack as intuitionistic negation. Log. J. IGPL 24(5): 807-837 (2016) - [c8]Dov M. Gabbay, Michael Gabbay:
Argumentation as Information Input: A Position Paper. COMMA 2016: 311-318 - 2015
- [j4]Dov M. Gabbay, Michael Gabbay:
The attack as strong negation, part I. Log. J. IGPL 23(6): 881-941 (2015) - [i3]Dov M. Gabbay, Michael Gabbay:
The Attack as Strong Negation, Part I. CoRR abs/1506.03266 (2015) - [i2]Dov M. Gabbay, Michael Gabbay:
The Attack as Intuitionistic Negation. CoRR abs/1510.00077 (2015) - 2014
- [j3]Michael Gabbay, Murdoch Gabbay:
A simple and complete model theory for intensional and extensional untyped lambda-equality. FLAP 1(2): 83-106 (2014) - [p1]Michael Gabbay:
A simple and complete model theory for intensional and extensional untyped λ-equality. HOWARD-60 2014: 165-177 - 2013
- [i1]Murdoch James Gabbay, Michael Gabbay:
Representation and duality of the. CoRR abs/1305.5968 (2013) - 2011
- [j2]Michael Gabbay:
A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language. J. Symb. Log. 76(2): 673-699 (2011) - 2010
- [j1]Michael Gabbay:
A Formalist Philosophy of Mathematics Part I: Arithmetic. Stud Logica 96(2): 219-238 (2010) - [c7]Michael Gabbay, Murdoch James Gabbay:
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing. LPAR (Dakar) 2010: 231-254
2000 – 2009
- 2008
- [c6]Murdoch Gabbay, Michael Gabbay:
Substitution for Fraenkel-Mostowski foundations. AISB Convention 2008: 65-72 - [c5]Michael Gabbay, Murdoch James Gabbay:
Term Sequent Logic. WFLP 2008: 87-106 - 2007
- [c4]Murdoch Gabbay, Michael Gabbay:
a-Logic With Arrows. WFLP@RDP 2007: 3-29 - 2005
- [c3]Michael Gabbay, Murdoch Gabbay:
Some Formal Considerations on Gabbay's Restart Rule in Natural Deduction and Goal-Directed Reasoning. We Will Show Them! (1) 2005: 701-730 - [c2]Murdoch Gabbay, Michael Gabbay:
a-logic. We Will Show Them! (1) 2005: 731-764 - 2000
- [c1]Michael Gabbay:
A Conversational Logic : wa and ga. PACLIC 2000: 87-96
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint