David Makinson

According to our database1, David Makinson authored at least 43 papers between 1966 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Frege's Ontological Diagram Completed.
Logica Universalis, 2022

2020
Sets, Logic and Maths for Computing, Third Edition
Undergraduate Topics in Computer Science, Springer, ISBN: 978-3-030-42217-2, 2020

2015
Book Review: Nicholas J.J. Smith, Logic: The Laws of Truth.
Stud Logica, 2015

Göodel's Master Argument: What is it, and what can it do?
FLAP, 2015

2014
On an inferential semantics for classical logic.
Log. J. IGPL, 2014

2012
Logical questions behind the lottery and preface paradoxes: lossy rules for uncertain inference.
Synth., 2012

Sets, Logic and Maths for Computing, Second Edition.
Undergraduate Topics in Computer Science, Springer, ISBN: 978-1-4471-2499-3, 2012

2011
Conditional Probability in the Light of Qualitative Belief Change.
J. Philos. Log., 2011

2009
Propositional relevance through letter-sharing.
J. Appl. Log., 2009

From Logic to Mathematical Philosophy.
Proceedings of the Towards Mathematical Philosophy, 2009

2008
Sets, Logic and Maths for Computing.
Undergraduate Topics in Computer Science, Springer, ISBN: 978-1-84628-845-6, 2008

2007
The Quantitative/Qualitative Watershed for Rules of Uncertain Inference.
Stud Logica, 2007

Parallel interpolation, splitting, and relevance in belief change.
J. Symb. Log., 2007

What is Input/Output Logic? Input/Output Logic, Constraints, Permissions.
Proceedings of the Normative Multi-agent Systems, 18.03. - 23.03.2007, 2007

Propositional Relevance through Letter-Sharing: Review and Contribution.
Proceedings of the Formal Models of Belief Change in Rational Agents, 26.08. - 30.08.2007, 2007

2005
Friendliness for Logicians.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume Two, 2005

Bridges from classical to nonmonotonic logic.
Texts in computing 5, College Publications, ISBN: 978-1-904987-00-0, 2005

2003
Permission from an Input/Output Perspective.
J. Philos. Log., 2003

Bridges between Classical and Nonmonotonic Logic.
Log. J. IGPL, 2003

2001
Constraints for Input/Output Logics.
J. Philos. Log., 2001

2000
Input/Output Logics.
J. Philos. Log., 2000

1997
Beyond Rational Monotony: Some Strong Non-Horn Rules for Nonmonotonic Inference Relations.
J. Log. Comput., 1997

1994
Local and Global Metrics for the Semantics of Counterfactual Conditionals.
J. Appl. Non Class. Logics, 1994

Nonmonotonic Inference Based on Expectations.
Artif. Intell., 1994

1993
Five faces of minimality.
Stud Logica, 1993

1992
The Relationship between KLM and MAK models for Nonmonotonic Inference Operations.
J. Log. Lang. Inf., 1992

1991
Floating Conclusions and Zombie Paths: Two Deep Difficulties in the "Directly Skeptical" Approach to Defeasible Inheritance Nets.
Artif. Intell., 1991

JTMS and Logic Programming.
Proceedings of the Logic Programming and Non-monotonic Reasoning, 1991

1990
The Gärdenfors impossibility theorem in non-monotonic contexts.
Stud Logica, 1990

Cumulative Inference Relations for JTMS and Logic Programming.
Proceedings of the Nonmonotonic and Inductive Logic, 1990

1989
Relations between the logic of theory change and nonmonotonic logic.
Proceedings of the Logic of Theory Change, 1989

1988
Revisions of Knowledge Systems Using Epistemic Entrenchment.
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, 1988

General Theory of Cumulative Inference.
Proceedings of the Non-Monotonic Reasoning, 1988

1987
On the status of the postulate of recovery in the logic of theory change.
J. Philos. Log., 1987

1986
Maps between some different kinds of contraction function: The finite case.
Stud Logica, 1986

On the formal representation of rights relations.
J. Philos. Log., 1986

1985
On the logic of theory change: Safe contraction.
Stud Logica, 1985

On the Logic of Theory Change: Partial Meet Contraction and Revision Functions.
J. Symb. Log., 1985

1981
Non-Equivalent Formulae in one Variable in A Strong Omnitemporal Modal Logic.
Math. Log. Q., 1981

1973
A warning about the choice of primitive operators in modal logic.
J. Philos. Log., 1973

1971
Some embedding theorems for modal logic.
Notre Dame J. Formal Log., 1971

1969
A Normal Modal Calculus Between T and S4 Without the Finite Model Property.
J. Symb. Log., 1969

1966
There are Infinitely many Diodorean Modal Functions.
J. Symb. Log., 1966


  Loading...