David Makinson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 46 from 46

2025

Hamilton's cumular conception of quantifying particles: an exercise in third-order logicDavid Makinson. logcom, 35(7), 2025. [doi]

2024

First-order FriendlinessGuillermo Badia, David Makinson. rsl, 17(4):1055-1069, 2024. [doi]

Display Conventions for Octagons of OppositionDavid Makinson. axioms, 13(5):287, May 2024. [doi]

2022

Frege's Ontological Diagram CompletedDavid Makinson. lu, 16(3):381-387, 2022. [doi]

2020

Sets, Logic and Maths for Computing, Third EditionDavid Makinson. Undergraduate Topics in Computer Science, Springer, 2020. [doi]

2015

Book Review: Nicholas J.J. Smith, Logic: The Laws of TruthDavid Makinson. sLogica, 103(1):233-237, 2015. [doi]

Göodel's Master Argument: What is it, and what can it do?David Makinson. flap, 2(2):1-16, 2015. [doi]

2014

On an inferential semantics for classical logicDavid Makinson. igpl, 22(1):147-154, 2014. [doi]

2012

Logical questions behind the lottery and preface paradoxes: lossy rules for uncertain inferenceDavid Makinson. synthese, 186(2):511-529, 2012. [doi]

Sets, Logic and Maths for Computing, Second EditionDavid Makinson. Undergraduate topics in computer science, Springer, 2012. [doi]

2011

Conditional Probability in the Light of Qualitative Belief ChangeDavid Makinson. jphil, 40(2):121-153, 2011. [doi]

2009

Propositional relevance through letter-sharingDavid Makinson. japll, 7(4):377-387, 2009. [doi]

From Logic to Mathematical PhilosophyDavid Makinson, Jacek Malinowski, Heinrich Wansing. In David Makinson, Jacek Malinowski, Heinrich Wansing, editors, Towards Mathematical Philosophy. Volume 28 of Trends in logic, pages 1-7, Springer, 2009. [doi]

2008

Sets, Logic and Maths for ComputingDavid Makinson. Undergraduate Topics in Computer Science, Springer, 2008. [doi]

2007

The Quantitative/Qualitative Watershed for Rules of Uncertain InferenceJames Hawthorne, David Makinson. sLogica, 86(2):247-297, 2007. [doi]

Parallel interpolation, splitting, and relevance in belief changeGeorge Kourousias, David Makinson. JSYML, 72(3):994-1002, 2007. [doi]

Propositional Relevance through Letter-Sharing: Review and ContributionDavid Makinson. Dagstuhl 2007: [doi]

What is Input/Output Logic? Input/Output Logic, Constraints, PermissionsDavid Makinson, Leendert W. N. van der Torre. Dagstuhl 2007: [doi]

2005

Friendliness for LogiciansDavid Makinson. BIRTHDAY 2005: 259-292

Bridges from classical to nonmonotonic logicDavid Makinson. Volume 5 of Texts in computing, College Publications, 2005.

2003

Permission from an Input/Output PerspectiveDavid Makinson, Leendert van der Torre. jphil, 32(4):391-416, 2003. [doi]

Bridges between Classical and Nonmonotonic LogicDavid Makinson. igpl, 11(1):69-96, 2003. [doi]

2001

Constraints for Input/Output LogicsDavid Makinson, Leendert van der Torre. jphil, 30(2):155-185, 2001. [doi]

2000

Input/Output LogicsDavid Makinson, Leendert van der Torre. jphil, 29(4):383-408, 2000. [doi]

1997

Beyond Rational Monotony: Some Strong Non-Horn Rules for Nonmonotonic Inference RelationsHassan Bezzazi, David Makinson, Ramón Pino Pérez. logcom, 7(5):605-631, 1997.

1994

Nonmonotonic Inference Based on ExpectationsPeter Gärdenfors, David Makinson. ai, 65(2):197-245, 1994.

Local and Global Metrics for the Semantics of Counterfactual ConditionalsKarl Schlechta, David Makinson. jancl, 4(2):129-140, 1994.

1993

Five faces of minimalityDavid Makinson. sLogica, 52(3):339-380, 1993.

1992

The Relationship between KLM and MAK models for Nonmonotonic Inference OperationsJürgen Dix, David Makinson. jolli, 1(2):131-140, 1992.

1991

JTMS and Logic ProgrammingGerhard Brewka, David Makinson, Karl Schlechta. lpnmr 1991: 199-210

Floating Conclusions and Zombie Paths: Two Deep Difficulties in the Directly Skeptical Approach to Defeasible Inheritance NetsDavid Makinson, Karl Schlechta. ai, 48(2):199-209, 1991.

1990

Cumulative Inference Relations for JTMS and Logic ProgrammingGerhard Brewka, David Makinson, Karl Schlechta. nil 1991: 1-12

The Gärdenfors impossibility theorem in non-monotonic contextsDavid Makinson. sLogica, 49(1):1-6, 1990. [doi]

1989

Relations between the logic of theory change and nonmonotonic logicDavid Makinson, Peter Gärdenfors. ltc 1991: 185-205

1988

Revisions of Knowledge Systems Using Epistemic EntrenchmentPeter Gärdenfors, David Makinson. tark 1988: 83-95

General Theory of Cumulative InferenceDavid Makinson. nmr 1989: 1-18

1987

On the status of the postulate of recovery in the logic of theory changeDavid Makinson. jphil, 16(4):383-394, 1987. [doi]

1986

Maps between some different kinds of contraction function: The finite caseCarlos E. Alchourrón, David Makinson. sLogica, 45(2):187-198, 1986. [doi]

On the formal representation of rights relationsDavid Makinson. jphil, 15(4):403-425, 1986. [doi]

1985

On the Logic of Theory Change: Partial Meet Contraction and Revision FunctionsCarlos E. Alchourrón, Peter Gärdenfors, David Makinson. JSYML, 50(2):510-530, 1985.

On the logic of theory change: Safe contractionCarlos E. Alchourrón, David Makinson. sLogica, 44(4):405-422, 1985. [doi]

1981

Non-Equivalent Formulae in one Variable in A Strong Omnitemporal Modal LogicDavid Makinson. mlq, 27(7):111-112, 1981. [doi]

1973

A warning about the choice of primitive operators in modal logicDavid Makinson. jphil, 2(2):193-196, 1973. [doi]

1971

Some embedding theorems for modal logicDavid Makinson. ndjfl, 12(2):252-254, 1971. [doi]

1969

A Normal Modal Calculus Between T and S4 Without the Finite Model PropertyDavid Makinson. JSYML, 34(1):35-38, 1969.

1966

There are Infinitely many Diodorean Modal FunctionsDavid Makinson. JSYML, 31(3):406-408, 1966.

Sign in or sign up to see more results.

runs on WebDSL