default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Makinson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]David Makinson:
Display Conventions for Octagons of Opposition. Axioms 13(5): 287 (2024)- 2022
- [j30]David Makinson:
Frege's Ontological Diagram Completed. Logica Universalis 16(3): 381-387 (2022) - 2020
- [b4]David Makinson:
Sets, Logic and Maths for Computing, Third Edition. Undergraduate Topics in Computer Science, Springer 2020, ISBN 978-3-030-42217-2, pp. 3-388
2010 – 2019
- 2015
- [j29]David Makinson:
Göodel's Master Argument: What is it, and what can it do? FLAP 2(2): 1-16 (2015) - [j28]David Makinson:
Book Review: Nicholas J.J. Smith, Logic: The Laws of Truth. Stud Logica 103(1): 233-237 (2015) - 2014
- [j27]David Makinson:
On an inferential semantics for classical logic. Log. J. IGPL 22(1): 147-154 (2014) - 2012
- [b3]David Makinson:
Sets, Logic and Maths for Computing, Second Edition. Undergraduate Topics in Computer Science, Springer 2012, ISBN 978-1-4471-2499-3, pp. I-XXI, 1-283 - [j26]David Makinson:
Logical questions behind the lottery and preface paradoxes: lossy rules for uncertain inference. Synth. 186(2): 511-529 (2012) - 2011
- [j25]David Makinson:
Conditional Probability in the Light of Qualitative Belief Change. J. Philos. Log. 40(2): 121-153 (2011)
2000 – 2009
- 2009
- [j24]David Makinson:
Propositional relevance through letter-sharing. J. Appl. Log. 7(4): 377-387 (2009) - [p1]David Makinson, Jacek Malinowski, Heinrich Wansing
:
From Logic to Mathematical Philosophy. Towards Mathematical Philosophy 2009: 1-7 - [e1]David Makinson, Jacek Malinowski, Heinrich Wansing:
Towards Mathematical Philosophy. Trends in logic 28, Springer 2009, ISBN 978-1-4020-9083-7 [contents] - 2008
- [b2]David Makinson:
Sets, Logic and Maths for Computing. Undergraduate Topics in Computer Science, Springer 2008, ISBN 978-1-84628-844-9, pp. i-xv, 1-301 - 2007
- [j23]George Kourousias, David Makinson:
Parallel interpolation, splitting, and relevance in belief change. J. Symb. Log. 72(3): 994-1002 (2007) - [j22]James Hawthorne, David Makinson:
The Quantitative/Qualitative Watershed for Rules of Uncertain Inference. Stud Logica 86(2): 247-297 (2007) - [i2]David Makinson:
Propositional Relevance through Letter-Sharing: Review and Contribution. Formal Models of Belief Change in Rational Agents 2007 - [i1]David Makinson, Leendert W. N. van der Torre:
What is Input/Output Logic? Input/Output Logic, Constraints, Permissions. Normative Multi-agent Systems 2007 - 2005
- [b1]David Makinson:
Bridges from classical to nonmonotonic logic. Texts in computing 5, College Publications 2005, ISBN 978-1-904987-00-0, pp. I-XVI, 1-216 - [c6]David Makinson:
Friendliness for Logicians. We Will Show Them! (2) 2005: 259-292 - 2003
- [j21]David Makinson:
Bridges between Classical and Nonmonotonic Logic. Log. J. IGPL 11(1): 69-96 (2003) - [j20]David Makinson, Leendert W. N. van der Torre:
Permission from an Input/Output Perspective. J. Philos. Log. 32(4): 391-416 (2003) - 2001
- [j19]David Makinson, Leendert W. N. van der Torre:
Constraints for Input/Output Logics. J. Philos. Log. 30(2): 155-185 (2001) - 2000
- [j18]David Makinson, Leendert W. N. van der Torre:
Input/Output Logics. J. Philos. Log. 29(4): 383-408 (2000)
1990 – 1999
- 1997
- [j17]Hassan Bezzazi, David Makinson, Ramón Pino Pérez:
Beyond Rational Monotony: Some Strong Non-Horn Rules for Nonmonotonic Inference Relations. J. Log. Comput. 7(5): 605-631 (1997) - 1994
- [j16]Peter Gärdenfors, David Makinson:
Nonmonotonic Inference Based on Expectations. Artif. Intell. 65(2): 197-245 (1994) - [j15]Karl Schlechta, David Makinson:
Local and Global Metrics for the Semantics of Counterfactual Conditionals. J. Appl. Non Class. Logics 4(2): 129-140 (1994) - 1993
- [j14]David Makinson:
Five faces of minimality. Stud Logica 52(3): 339-380 (1993) - 1992
- [j13]Jürgen Dix, David Makinson:
The Relationship between KLM and MAK models for Nonmonotonic Inference Operations. J. Log. Lang. Inf. 1(2): 131-140 (1992) - 1991
- [j12]David Makinson, Karl Schlechta:
Floating Conclusions and Zombie Paths: Two Deep Difficulties in the "Directly Skeptical" Approach to Defeasible Inheritance Nets. Artif. Intell. 48(2): 199-209 (1991) - [c5]Gerhard Brewka, David Makinson, Karl Schlechta:
JTMS and Logic Programming. LPNMR 1991: 199-210 - 1990
- [j11]David Makinson:
The Gärdenfors impossibility theorem in non-monotonic contexts. Stud Logica 49(1): 1-6 (1990) - [c4]Gerhard Brewka, David Makinson, Karl Schlechta:
Cumulative Inference Relations for JTMS and Logic Programming. Nonmonotonic and Inductive Logic 1990: 1-12
1980 – 1989
- 1989
- [c3]David Makinson, Peter Gärdenfors:
Relations between the logic of theory change and nonmonotonic logic. The Logic of Theory Change 1989: 185-205 - 1988
- [c2]David Makinson:
General Theory of Cumulative Inference. NMR 1988: 1-18 - [c1]Peter Gärdenfors, David Makinson:
Revisions of Knowledge Systems Using Epistemic Entrenchment. TARK 1988: 83-95 - 1987
- [j10]David Makinson:
On the status of the postulate of recovery in the logic of theory change. J. Philos. Log. 16(4): 383-394 (1987) - 1986
- [j9]David Makinson:
On the formal representation of rights relations. J. Philos. Log. 15(4): 403-425 (1986) - [j8]Carlos E. Alchourrón, David Makinson:
Maps between some different kinds of contraction function: The finite case. Stud Logica 45(2): 187-198 (1986) - 1985
- [j7]Carlos E. Alchourrón, Peter Gärdenfors, David Makinson:
On the Logic of Theory Change: Partial Meet Contraction and Revision Functions. J. Symb. Log. 50(2): 510-530 (1985) - [j6]Carlos E. Alchourrón, David Makinson:
On the logic of theory change: Safe contraction. Stud Logica 44(4): 405-422 (1985) - 1981
- [j5]David Makinson:
Non-Equivalent Formulae in one Variable in A Strong Omnitemporal Modal Logic. Math. Log. Q. 27(7): 111-112 (1981)
1970 – 1979
- 1973
- [j4]David Makinson:
A warning about the choice of primitive operators in modal logic. J. Philos. Log. 2(2): 193-196 (1973) - 1971
- [j3]David Makinson:
Some embedding theorems for modal logic. Notre Dame J. Formal Log. 12(2): 252-254 (1971)
1960 – 1969
- 1969
- [j2]David Makinson:
A Normal Modal Calculus Between T and S4 Without the Finite Model Property. J. Symb. Log. 34(1): 35-38 (1969) - 1966
- [j1]David Makinson:
There are Infinitely many Diodorean Modal Functions. J. Symb. Log. 31(3): 406-408 (1966)
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 2024-10-07 22:06 CEST 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:
