default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Makkai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j14]Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell:
Addendum to "Recursively defined metric spaces without contraction" [TCS 380 (1/2) (2007) 143-163]. Theor. Comput. Sci. 492: 117-122 (2013)
2000 – 2009
- 2007
- [j13]Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell
:
Recursively defined metric spaces without contraction. Theor. Comput. Sci. 380(1-2): 143-163 (2007) - 2005
- [c4]Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell:
An Accessible Approach to Behavioural Pseudometrics. ICALP 2005: 1018-1030
1990 – 1999
- 1998
- [c3]Claudio Hermida, Michael Makkai, John Power:
Higher Dimensional Multigraphs. LICS 1998: 199-206 - 1997
- [c2]Michael Makkai, Giuseppe Rosolini:
Studying repleteness in the category of cpos. MFPS 1997: 249-254 - 1995
- [j12]Michael Makkai, Gonzalo E. Reyes:
Completeness Results for Intuitionistic and Modal Logic in a Categorical Setting. Ann. Pure Appl. Log. 72(1): 25-101 (1995) - [j11]Michael Makkai:
On Gabbay's Proof of the Craig Interpolation Theorem for Intuitionistic Predicate Logic. Notre Dame J. Formal Log. 36(3): 364-381 (1995) - [c1]Michael Makkai:
Towards a Categorical Foundation of Mathematics. Logic Colloquium 1995: 153-190 - 1993
- [j10]Michael Makkai:
The fibrational formulation of intuitionistic predicate logic I: completeness according to Gödel, Kripke, and Läuchli, Part 1. Notre Dame J. Formal Log. 34(3): 334-377 (1993) - [j9]Michael Makkai:
The fibrational formulation of intuitionistic predicate logic I: completeness according to Gödel, Kripke, and Läuchli, Part 2. Notre Dame J. Formal Log. 34(4): 471-498 (1993) - 1992
- [j8]Victor Harnik, Michael Makkai:
Lambek's Categorical Proof Theory and Läuchli's Abstract Realizability. J. Symb. Log. 57(1): 200-230 (1992) - 1990
- [j7]Saharon Shelah, Michael Makkai:
Categoricity of Theories in Lk omega, with k a Compact Ordinal. Ann. Pure Appl. Log. 47(1): 41-97 (1990) - [j6]Michael Makkai:
A Theorem on Barr-Exact Categories, with an Infinitary Generalization. Ann. Pure Appl. Log. 47(3): 225-268 (1990)
1980 – 1989
- 1988
- [j5]Michael Makkai:
Strong conceptual completeness for first-order logic. Ann. Pure Appl. Log. 40(2): 167-215 (1988) - 1985
- [j4]Leo Harrington, Michael Makkai:
An exposition of Shelah's "main gap": counting uncountable models of ω-stable and superstable theories. Notre Dame J. Formal Log. 26(2): 139-177 (1985) - 1981
- [j3]Michael Makkai:
An Example Concerning Scott Heights. J. Symb. Log. 46(2): 301-318 (1981)
1970 – 1979
- 1976
- [j2]Victor Harnik, Michael Makkai:
Applications of Vaught Sentences and the Covering Theorem. J. Symb. Log. 41(1): 171-187 (1976)
1960 – 1969
- 1969
- [j1]Michael Makkai:
On the Model Theory of Denumerably Long Formulas with Finite Strings of Quantifiers. J. Symb. Log. 34(3): 437-459 (1969)
Coauthor Index
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 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
