Ceteris paribus logic

In this paper, we develop a parametric language for ceteris paribus reasoning (everything else being equal) that is free from the assumptions of finiteness and exactitude and use it to provide an axiomatisation for an equivalent infinitary fragment of ceteris paribus logic as formulated with language models in van Benthem, Girard and Roy (2009).