Every artificial-intelligence research project needs a working definition of "intelligence", on which the deepest goals and assumptions of the research are based. In the project described in the following chapters, "intelligence" is defined as the capacity to adapt under insufficient knowledge and resources. Concretely, an intelligent system should be finite and open, and should work in real time. ;If these criteria are used in the design of a reasoning system, the result is NARS, a non-axiomatic reasoning system. (...) ;NARS uses a term-oriented formal language, characterized by the use of subject-predicate sentences. The language has an experience-grounded semantics, according to which the truth value of a judgment is determined by previous experience, and the meaning of a term is determined by its relations with other terms. Several different types of uncertainty, such as randomness, fuzziness, and ignorance, can be represented in the language in a single way. ;The inference rules of NARS are based on three inheritance relations between terms. With different combinations of premises, revision, deduction, induction, abduction, exemplification, comparison, and analogy can all be carried out in a uniform format, the major difference between these types of inference being that different functions are used to calculate the truth value of the conclusion from the truth values of the premises. ;Since it has insufficient space-time resources, the system needs to distribute them among its tasks very carefully, and to dynamically adjust the distribution as the situation changes. This leads to a "controlled concurrency" control mechanism, and a "bag-based" memory organization. ;A recent implementation of the NARS model, with examples, is discussed. The system has many interesting properties that are shared by human cognition, but are absent from conventional computational models of reasoning. ;This research sheds light on several notions in artificial intelligence and cognitive science, including symbol-grounding, induction, categorization, logic, and computation. These are discussed to show the implications of the new theory of intelligence. ;Finally, the major results of the research are summarized, a preliminary evaluation of the working definition of intelligence is given, and the limitations and future extensions of the research are discussed. (shrink)

Notes mainly on model-oriented vs. deduction-oriented conceptions of axiomatic reasoning.

Following recent developments in the literature on axiomatic theories of truth, we investigate an alternative to the widespread habit of formalizing the syntax of the object-language into the object-language itself. We first argue for the proposed revision, elaborating philosophical evidences in favor of it. Secondly, we present a general framework for axiomatic theories of truth with theories of syntax. Different choices of the object theory O will be considered. Moreover, some strengthenings of these theories will be introduced: we (...) will consider extending the theories by the addition of coding axioms or by extending the schemas of O, if present, to the entire vocabulary of our theory of truth. Finally, we touch on the philosophical consequences that the theories described can have on the debate about the metaphysical status of the truth predicate and on the formalization of our informal metatheoretic reasoning. (shrink)

Sound and complete axiomatizations are provided for a number of different logics involving modalities for the knowledge of multiple agents and operators for branching time, extending previous work of Halpern, van der Meyden and Vardi [to appear, SIAM Journal on Computing] for logics of knowledge and linear time. The paper considers the system constraints of synchrony, perfect recall and unique initial states, which give rise to interaction axioms. The language is based on the temporal logic CTL*, interpreted with respect to (...) a version of the bundle semantics. (shrink)

Sound and complete axiomatizations are provided for a number of different logics involving modalities for the knowledge of multiple agents and operators for branching time, extending previous work of Halpern, van der Meyden and Vardi [to appear, SIAM Journal on Computing] for logics of knowledge and linear time. The paper considers the system constraints of synchrony, perfect recall and unique initial states, which give rise to interaction axioms. The language is based on the temporal logic CTL*, interpreted with respect to (...) a version of the bundle semantics. (shrink)

This book provides a systematic and comprehensive description of Non-Axiomatic Logic, which is the result of the author's research for about three decades.Non-Axiomatic Logic is designed to provide a uniform logical foundation for Artificial Intelligence, as well as an abstract description of the “laws of thought” followed by the human mind. Different from “mathematical” logic, where the focus is the regularity required when demonstrating mathematical conclusions, Non-Axiomatic Logic is an attempt to return to the original aim of (...) logic, that is, to formulate the regularity in actual human thinking. To achieve this goal, the logic is designed under the assumption that the system has insufficient knowledge and resources with respect to the problems to be solved, so that the “logical conclusions” are only valid with respect to the available knowledge and resources. Reasoning processes according to this logic covers cognitive functions like learning, planning, decision making, problem solving, etc.This book is written for researchers and students in Artificial Intelligence and Cognitive Science, and can be used as a textbook for courses at graduate level, or upper-level undergraduate, on Non-Axiomatic Logic. (shrink)

This paper studies a class of infinite-valued predicate logics. A sufficient condition for axiomatizability of logics from that class is given.

In the epicenter of his attempt to justify the “objective validity” of morality and freedom in the Critique of Practical Reason, Kant introduces a so-called fact of reason, which is rendered as the fact that human beings are consciou s of the moral ought’s categorical authority. However, few parts of Kant’s thinking have bemused commentators as much as this. In this article, the author explores a set of intersecting problems related to the fact of reason: (1) the problem of its (...) general argumentative role in Kant’s practical philosophy, (2) the problem of the fact as a brute fact. He argues that both problems can be understood and resolved only if we regard Kant’s introduction of the fact of reason as an implicit attempt to articulate intrinsic problems with reductive explanations of morality. His main claim, which has been surprisingly absent in most interpretations of Kant’s fact of reason, will be that the fact of reason functions as an undeniable yet improvable fact (similar to mathematical principles) from which other practical truths (such as the objective reality of freedom) can be derived. As Kant says unambiguously in the Jäsche-Logic : the “reality” of the moral law “is an axiom.”. (shrink)

Definitional and axiomatic theories of truth -- Objects of truth -- Tarski -- Truth and set theory -- Technical preliminaries -- Comparing axiomatic theories of truth -- Disquotation -- Classical compositional truth -- Hierarchies -- Typed and type-free theories of truth -- Reasons against typing -- Axioms and rules -- Axioms for type-free truth -- Classical symmetric truth -- Kripke-Feferman -- Axiomatizing Kripke's theory in partial logic -- Grounded truth -- Alternative evaluation schemata -- Disquotation -- Classical logic (...) -- Deflationism -- Reflection -- Ontological reduction -- Applying theories of truth. (shrink)

Axiomatic rationality is defined in terms of conformity to abstract axioms. Savage limited axiomatic rationality to small worlds, that is, situations in which the exhaustive and mutually exclusive set of future states S and their consequences C are known. Others have interpreted axiomatic rationality as a categorical norm for how human beings should reason, arguing in addition that violations would lead to real costs such as money pumps. Yet a review of the literature shows little evidence that (...) violations are actually associated with any measurable costs. Limiting axiomatic rationality to small worlds, I propose a naturalized version of rationality for situations of intractability and uncertainty, all of which are not in. In these situations, humans can achieve their goals by relying on heuristics that may violate axiomatic rationality. The study of ecological rationality requires formal models of heuristics and an analysis of the structures of environments these can exploit. It lays the foundation of a moderate naturalism in epistemology, providing statements about heuristics we should use in a given situation. Unlike axiomatic rationality, ecological rationality can explain less-is-more effects, formalize when one should move from ‘is’ to ‘ought,’ and be evaluated by goals beyond coherence, such as predictive accuracy, frugality, and efficiency. Ecological rationality can be seen as a formalization of means–end instrumentalist rationality, based on Herbert Simon’s insight that rational behavior is a function of the mind and its environment. (shrink)

Shortest possible axiomatizations for the implicational fragments of the modal logics S4 and S5 are reported. Among these axiomatizations is included a shortest single axiom for implicational S4—which to our knowledge is the first reported single axiom for that system—and several new shortest single axioms for implicational S5. A variety of automated reasoning strategies were essential to our discoveries.

We discuss the axiomatization of generalized consequence relations determined by non-deterministic matrices. We show that, under reasonable expressiveness requirements, simple axiomatizations can always be obtained, using inference rules which can have more than one conclusion. Further, when the non-deterministic matrices are finite we obtain finite axiomatizations with a suitable generalized subformula property.

We investigate under what conditions a given set of collective judgments can arise from a specific voting procedure. In order to answer this question, we introduce a language similar to modal logic for reasoning about judgment aggregation procedures. In this language, the formula expresses that is collectively accepted, or that is a group judgment based on voting. Different judgment aggregation procedures may be underlying the group decision making. Here we investigate majority voting, where holds if a majority of individuals (...) accepts, consensus voting, where holds if all individuals accept, and dictatorship. We provide complete axiomatizations for judgment sets arising from all three aggregation procedures. (shrink)

While much of semantic theorizing is based on intuitions about logical phenomena associated with linguistic constructions—phenomena such as consistency and entailment—it is rare to see axiomatic treatments of linguistic fragments. Given a fragment interpreted in some class of formally specified models, it is often possible to ask for a characterization of the reasoning patterns validated by the class of models. Axiomatizations provide such a characterization, often in a perspicuous and efficient manner. In this paper, we highlight some of (...) the benefits of providing axiomatizations for the purpose of semantic theorizing. We illustrate some of these benefits using three examples from the study of modality. (shrink)

In normative reasoning one typically refers to intervals of time across which norms are intended to hold, as well as to alternative possibilities representing hypothetical developments of a given scenario. Thus, deontic modalities are naturally intertwined with temporal and metaphysical ones. Furthermore, contemporary debates in philosophy suggest that a proper understanding of fundamental ethical principles, such as the Ought-Implies-Can thesis, requires a simultaneous analysis of these three families of concepts. In the present article we propose a general formal framework (...) which allows for fine-grained multimodal reasoning in the normative domain. We provide an axiomatization for a novel system of propositional logic encoding the way in which possibilities and norms arising from different sources change over intervals of time. The usefulness of our framework is illustrated by analysing an ancient and particularly challenging `cold case', the Paradox of the Court. (shrink)

This paper sketches the antilogism of Christine Ladd-Franklin and historical advancement about antilogism, mainly constructs an axiomatic system Atl based on first-order logic with equality and the wholly-exclusion and not-wholly-exclusion relations abstracted from the algebra of Ladd-Franklin, with soundness and completeness of Atl proved, providing a simple and convenient tool on syllogistic reasoning. Atl depicts the empty class and the whole class differently from normal set theories, e.g. ZFC, revealing another perspective on sets and set theories. Two series (...) of Dotterer and the theorem proved by Russinoff are re-characterized in antilogistic formulas corresponding to the square of opposition and twenty-four moods of syllogism. Then the restricted equivalence between two forms of antilogism and minimal inconsistency is built up, implying the internal connection between antilogisms and minimal inconsistency and leaving two related conjectures not proved. Besides, this paper provides a new explanation for the reason why contrariety, subcontrariety, and subalternation and the nine special moods require the non-empty assumption. (shrink)

In a recent paper, Kit Fine presents some striking results concerning the logical properties of (first-order) ignorance, second-order ignorance and Rumsfeld ignorance. However, Rumsfeld ignorance is definable in terms of ignorance, which makes some existing results and the axiomatization problem trivial. A main reason is that the accessibility relations for the implicit knowledge operator contained in the packaged operators of ignorance and Rumsfeld ignorance are the same. In this work, we assume the two accessibility relations to be different so that (...) one of them is an arbitrary subset of the other. This will avoid the definability issue and retain most of the previous validities. The main results are axiomatizations over various proper bi-frame classes. Finally we apply our framework to analyze Fine’s results. (shrink)

The modern notion of the axiomatic method developed as a part of the conceptualization of mathematics starting in the nineteenth century. The basic idea of the method is the capture of a class of structures as the models of an axiomatic system. The mathematical study of such classes of structures is not exhausted by the derivation of theorems from the axioms but includes normally the metatheory of the axiom system. This conception of axiomatization satisfies the crucial requirement that (...) the derivation of theorems from axioms does not produce new information in the usual sense of the term called depth information. It can produce new information in a different sense of information called surface information. It is argued in this paper that the derivation should be based on a model-theoretical relation of logical consequence rather than derivability by means of mechanical (recursive) rules. Likewise completeness must be understood by reference to a model-theoretical consequence relation. A correctly understood notion of axiomatization does not apply to purely logical theories. In the latter the only relevant kind of axiomatization amounts to recursive enumeration of logical truths. First-order “axiomatic” set theories are not genuine axiomatizations. The main reason is that their models are structures of particulars, not of sets. Axiomatization cannot usually be motivated epistemologically, but it is related to the idea of explanation. (shrink)

While much of semantic theorizing is based on intuitions about logical phenomena associated with linguistic constructions—phenomena such as consistency and entailment—it is rare to see axiomatic treatments of linguistic fragments. Given a fragment interpreted in some class of formally specified models, it is often possible to ask for a characterization of the reasoning patterns validated by the class of models. Axiomatizations provide such a characterization, often in a perspicuous and efficient manner. In this paper, we highlight some of (...) the benefits of providing axiomatizations for the purpose of semantic theorizing. We illustrate some of these benefits using three examples from the study of modality. (shrink)

Starting from a generalization of the standard axioms for a monoid we present a stepwise development of various, mutually equivalent foundational axiom systems for category theory. Our axiom sets have been formalized in the Isabelle/HOL interactive proof assistant, and this formalization utilizes a semantically correct embedding of free logic in classical higher-order logic. The modeling and formal analysis of our axiom sets has been significantly supported by series of experiments with automated reasoning tools integrated with Isabelle/HOL. We also address (...) the relation of our axiom systems to alternative proposals from the literature, including an axiom set proposed by Freyd and Scedrov for which we reveal a technical issue (when encoded in free logic where free variables range over defined and undefined objects): either all operations, e.g. morphism composition, are total or their axiom system is inconsistent. The repair for this problem is quite straightforward, however. (shrink)

This paper presents in outline Luigi Ferrajoli’s axiomatic and general theory of law, as developed in his lifelong work Principia Iuris . The first section focuses on the three main aspects of the theory: the methodological, the theoretical and the pragmatic, which respectively represent the theory’s syntax, semantics and its pragmatics. Ferrajoli identifies three deontic gaps of norms: firstly, the one between their validity and efficacy ; secondly, the one between their justice and validity ; and finally, and most (...) importantly, the one between validity and existence (i.e. normative force). The presence of such gaps is, according to Ferrajoli, the extraordinary innovation that entrenched constitutions have brought into modern legal systems, by establishing norms that are superior to statutes and case law. In this sense, all normative phenomena (except for the constitution itself) can be conceived both as norms and as facts. In the second section the role of juridical science is briefly discussed. (shrink)

Providing a means of translating RDF, RDF-S, and DAML+OIL descriptions into a first-order predicate calculus logical theory not only specifies the intended meaning of the descriptions, but also produces a representation of the descriptions from which inferences can automatically be made using traditional automatic theorem provers and problem solvers. For example, the DAML+OIL axioms enable a reasoner to infer from the two statements “Class Male and class Female are disjointWith.” and “John is type Male.” that the statement “John is type (...) Female.” is false. (shrink)

The Shapley value is the unique value defined on the class of cooperative games in characteristic function form which satisfies certain intuitively reasonable axioms. Alternatively, the Banzhaf value is the unique value satisfying a different set of axioms. The main drawback of the latter value is that it does not satisfy the efficiency axiom, so that the sum of the values assigned to the players does not need to be equal to the worth of the grand coalition. By definition, the (...) normalized Banzhaf value satisfies the efficiency axiom, but not the usual axiom of additivity. (shrink)

We present an axiomatization of a problem in commonsense reasoning, characterizing the proper procedure for cracking an egg and transferring its contents to a bowl. The axiomatization is mid-sized, larger than toy problems such as the Yale Shooting Problem or the Suitcase Problem, but much smaller than the comprehensive axiomatizations associated with CYC and HPKB. This size of axiomatization permits the development of non-trivial, reusable core theories of commonsense reasoning, acts as a testbed for existing theories of commonsense (...) reasoning, and encourages the discovery of new problems in commonsense reasoning.We present portions of core theories of containment, falling, and pouring, integrated into Shanahan's circumscriptive event calculus, and show how these can serve as the basis of an axiomatization that partly characterizes egg cracking. We discuss several commonsense reasoning problems encountered during this research, such as the Initial Specification Problem (a relative of the frame problem that occurs in theories in which fluents can trigger actions), and the Unobtainable State Problem (the problem of determining whether or not a theorem stating that one cannot get from one state to another is meaningful). (shrink)

A structural (as opposed to Zadeh's quantitative) approach to fuzziness is given, based on the operator "very", which is added to the language of set theory together with some elementary axioms about it. Due to the axiom of foundation and to a lifting axiom, the operator is proved trivial on the cumulative hierarchy of ZF. So we have to drop either foundation or lifting. Since fuzziness concerns complemented predicates rather than sets, a class theory is needed for the very operator. (...) And of them the Kelley-Morse (KM) theory is more appropriate for reasons of class existence. Several definable realizations of the very-operator are presented in KM⁻. In the last section we consider the operator "very" without the lifting axiom on classes of urelements. To each structurally fuzzy set X a traditional quantitative fuzzy set X̄ is assigned -- its quantitative representation. This way we are able partly to recover ordinary fuzzy sets from the structurally fuzzy ones. (shrink)

A structural approach to fuzziness is given, based on the operator "very", which is added to the language of set theory together with some elementary axioms about it. Due to the axiom of foundation and to a lifting axiom, the operator is proved trivial on the cumulative hierarchy of ZF. So we have to drop either foundation or lifting. Since fuzziness concerns complemented predicates rather than sets, a class theory is needed for the very operator. And of them the Kelley-Morse (...) theory is more appropriate for reasons of class existence. Several definable realizations of the very-operator are presented in KM⁻. In the last section we consider the operator "very" without the lifting axiom on classes of urelements. To each structurally fuzzy set X a traditional quantitative fuzzy set X̄ is assigned -- its quantitative representation. This way we are able partly to recover ordinary fuzzy sets from the structurally fuzzy ones. (shrink)

We provide first-order axioms for the theories of finite trees with bounded branching and finite trees with arbitrary (finite) branching. The signature is chosen to express, in a natural way, those properties of trees most relevant to linguistic theories. These axioms provide a foundation for results in linguistics that are based on reasoning formally about such properties. We include some observations on the expressive power of these theories relative to traditional language complexity classes.

Dynamic Topological Logic (DFH) is a multimodal system for reasoning about dynamical systems. It is defined semantically and, as such, most of the work done in the field has been model-theoretic. In particular, the problem of finding a complete axiomatization for the full language of DFH over the class of all dynamical systems has proven to be quite elusive. Here we propose to enrich the language to include a polyadic topological modality, originally introduced by Dawar and Otto in a (...) different context. We then provide a sound axiomatization for DFH over this extended language, and prove that it is complete. The polyadic modality is used in an essential way in our proof. (shrink)

Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators “t : ”, indexed over t by a corresponding set of justification terms, which thus explicitly encode the justification for the necessity assertion in the syntax. With these operators, one can therefore not only reason about modal effects on propositions but also about dynamics inside the justifications themselves. (...) We replace this classical boolean base with Gödel logic, one of the three most prominent fuzzy logics, i.e. special instances of many-valued logics, taking values in the unit interval [0, 1], which are intended to model inference under vagueness. We extend the canonical possible-world semantics for justification logic to this fuzzy realm by considering fuzzy accessibility- and evaluation-functions evaluated over the minimum t-norm and establish strong completeness theorems for various fuzzy analogies of prominent extensions for basic justification logic. (shrink)

In this book, Zalta attempts to lay the axiomatic foundations of metaphysics by developing and applying a (formal) theory of abstract objects. The cornerstones include a principle which presents precise conditions under which there are abstract objects and a principle which says when apparently distinct such objects are in fact identical. The principles are constructed out of a basic set of primitive notions, which are identified at the end of the Introduction, just before the theorizing begins. The main reason (...) for producing a theory which defines a logical space of abstract objects is that it may have a great deal of explanatory power. It is hoped that the data explained by means of the theory will be of interest to pure and applied metaphysicians, logicians and linguists, and pure and applied epistemologists. (shrink)

The paper advocates an epistemological interpretation of the Peano School axiomatics. The construction of axiom systems is presented as a cognitive enterprise unveiling the internal dynamics, evolution, and architecture of axiomatic systems as well as connections to applications. This approach reveals that the study of the relation between axioms and theorems not only serves to reduce a theory to a minimum number of principles and increase the certainty or justification of the latter, but also to study alternative settings of (...) a given mathematical theory. The paper explains why the Peanian conception of axiomatics differs from axiomatic deductivism, if-thenism and scientific deductivism, and analyzes Peano’s conception of rigor. The paper also postulates that Peano had a set-theoretic but also an algorithmic conception of function, and prioritized functions over relations. Two seemingly contradictory aspects of Peano’s axiomatics, global and local reasoning, are illustrated through the examples of rigor and simplicity. Finally, the paper claims that Peano’s axiomatics was a dynamic mathematical enterprise rather than an a priori axiomatization grounded on logical principles, which explains the difference with respect to Frege’s project. (shrink)

It is standard, both in the philosophical literature and in ordinary parlance, to assume that one can fall short of responding to all one’s moral reasons without being irrational. Yet when we turn to epistemic reasons, the situation could not be more different. Most epistemologists take it as axiomatic that for a belief to be rational is for it to be well-supported by epistemic reasons. We find ourselves with a striking asymmetry, then, between the moral and epistemic domains concerning (...) what is taken for granted about whether failures to respond to reasons are failures of rationality. My aim in this paper is to interrogate this asymmetry, and ultimately to argue that the asymmetry is groundless. Instead, I will offer an error theory to explain the asymmetry in intuitions. This error theory suggests that we should amend the conventional wisdom about the relationship between epistemic reasons and rationality. (shrink)

It is shown how Tarski’s 1929 axiomatization of mereology secures the reflexivity of the ‘part of’ relation. This is done with a fusion-abstraction principle that is constructively weaker than that of Tarski; and by means of constructive and relevant reasoning throughout. We place a premium on complete formal rigor of proof. Every step of reasoning is an application of a primitive rule; and the natural deductions themselves can be checked effectively for formal correctness.

It is shown how Tarski’s 1929 axiomatization of mereology secures the reflexivity of the ‘part of’ relation. This is done with a fusion-abstraction principle that is constructively weaker than that of Tarski; and by means of constructive and relevant reasoning throughout. We place a premium on complete formal rigor of proof. Every step of reasoning is an application of a primitive rule; and the natural deductions themselves can be checked effectively for formal correctness.

People tend to rank values of all kinds linearly from good to bad, but there is little reason to think that this is reasonable or correct. This book argues, to the contrary, that values are often partially ordered and hence frequently incomparable. Proceeding logically from a small set of axioms, John Nolt examines the great variety of partially ordered value structures, exposing fallacies that arise from overlooking them. He reveals various ways in which incomparability is obscured: using linear indices to (...) summarize partially ordered data, relying on an inadequately defined concept of parity, or conflating incomparability with vagueness. Incomparability can enrich and clarify a range of topics including the paradoxes of Derek Parfit, rational decision theory, and the infinite values of theology. Finally, Nolt shows how to generalize many of the concepts introduced earlier, explores the intricate depths of certain noteworthy partially ordered value structures, and argues for the finitude of value. Incomparable Values will be of interest to scholars and advanced students working in ethics, value theory, rational decision theory, and logic. (shrink)

Dynamic topological logic is a multi-modal logic that was introduced for reasoning about dynamic topological systems, i.e. structures of the form $\langle{\mathfrak{X}, f}\rangle $, where $\mathfrak{X}$ is a topological space and $f$ is a continuous function on it. The problem of finding a complete and natural axiomatization for this logic in the original tri-modal language has been open for more than one decade. In this paper, we give a natural axiomatization of $\textsf{DTL}$ and prove its strong completeness with respect (...) to the class of all dynamic topological systems. Our proof system is infinitary in the sense that it contains an infinitary derivation rule with countably many premises and one conclusion. It should be remarked that $\textsf{DTL}$ is semantically non-compact, so no finitary proof system for this logic could be strongly complete. Moreover, we provide an infinitary axiomatic system for the logic ${\textsf{DTL}}_{\mathcal{A}}$, i.e. the $\textsf{DTL}$ of Alexandrov spaces, and show that it is strongly complete with respect to the class of all dynamical systems based on Alexandrov spaces. (shrink)

In this paper we introduce Dynamic Epistemic Logic, which is alogic for reasoning about information change in a multi-agent system. Theinformation structures we use are based on non-well-founded sets, and canbe conceived as bisimulation classes of Kripke models. On these structures,we define a notion of information change that is inspired by UpdateSemantics (Veltman, 1996). We give a sound and complete axiomatization ofthe resulting logic, and we discuss applications to the puzzle of the dirtychildren, and to knowledge programs.

Causal reasoning is an aspect of learning, reasoning, and decision-making that involves the cognitive ability to discover relationships between causal relata, learn and understand these causal relationships, and make use of this causal knowledge in prediction, explanation, decision-making, and reasoning in terms of counterfactuals. Can we fully automate causal reasoning? One might feel inclined, on the basis of certain groundbreaking advances in causal epistemology, to reply in the affirmative. The aim of this paper is to demonstrate (...) that one still has good skeptical grounds for resisting any conclusions in favour of the automation of causal reasoning. If by causal reasoning is meant the entirety of the process through which we discover causal relationships and make use of this knowledge in prediction, explanation, decision-making, and reasoning in terms of counterfactuals, then one relies besides on tacit knowledge, as might be constituted by or derived from the epistemic faculty virtues and abilities of the causal reasoner, the value systems and character traits of the causal reasoner, the implicit knowledge base available to the causal reasoner, and the habits that sustain our causal reasoning practices. While certain aspects of causal reasoning may be axiomatized and formalized and algorithms may be implemented to approximate causal reasoning, one has to remain skeptical about whether causal reasoning may be fully automated. This demonstration will involve an engagement with Meno’s Paradox. (shrink)

We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logic is in subset spaces , and we obtain complete axiomatizations for the sentences which hold in these interpretations. In addition, we axiomatize the validities of the smaller class of topological spaces in a system we call topologic . We also prove decidability for these two systems. Our results on topologic (...) relate early work of McKinsey on topological interpretations of S4 with recent work of Georgatos on topologic. Some of the results of this paper were presented at the 1992 conference on Theoretical Aspects of Reasoning about Knowledge. (shrink)

In this paper, we rigorously prove the existence of type-level ordered pairs in Quine’s New Foundations with atoms, augmented by the axiom of infinity and the axiom of choice (NFU + Inf + AC). The proof uses the cardinal squaring principle; more precisely, its instance for the (infinite) universe (VCSP), which is a theorem of NFU + Inf + AC. Therefore, we have a justification for proposing a new axiomatic extension of NFU, in order to obtain type-level ordered pairs (...) almost from the beginning. This axiomatic extension is NFU + Inf + AC + VCSP, which is equivalent to NFU + Inf + AC, but easier to reason about. (shrink)

Two problems are discussed: Can and should psychological concepts be defined, and can and should they be organized in an axiomatic system? I point out that definitions in terms of physiological or behavioral measures are strictly impossible because any particular measure can mean anything, whereas phenomenological definitions always point to antecedents and consequents. I then point out that definitions of antecedents and consequents can be given either in terms of causes or in terms of reasons, and that causes and (...) reasons belong to two incompatible languages. Causes exist independently of persons and reasons exist only for persons. Only the latter belong to psychology, as I see it. The working of the system of psycho-logic is illustrated by an analysis of the conditions of trust. I conclude that psychological terms should be defined by means of semantic primitives, and that one should try to organize them in an axiomatic system. 2012 APA, all rights reserved). (shrink)

1. Argumentation consists in reasoning with conflicting information based on the exchange and evaluation of interacting arguments. It can be used for modelling dialogue (persuasion, negotiation), d...

Kant maintains that the only thing that is good in itself, and therefore good without limitation or qualification, is a good will. This is an objectionable claim in support of a controversial position. The problem is not just that the good will is not the only thing that is good in itself, which indeed it is not, but more importantly, that the good will is not so much a thing that is good in itself as it is the good kind (...) of a thing that is otherwise neither good nor bad in itself. The goodness of a good will is no more intrinsic than the goodness of a good act, good outcome, good attitude, good character, or good person. Nor is it even any more so than something as commonplace as a good laugh or a good cup of coffee. A good will, whatever else it may be, is a will that is good, much like how a good act is an act that is good, a good outcome is an outcome that is good, and so on with the other examples, not one of which is good for any reason other than the goodness predicated of the corresponding subject. This paper thus challenges Kant’s position on ontological grounds. It questions the validity of claiming intrinsic goodness for a complex construct whose goodness is, in fact, extrinsic to its substance. The objection is not that the good will might not turn out to be good after all, which is impossible by definition, designation, or stipulation, but that its goodness is axiomatic and derivative rather than intrinsic or fundamental. (shrink)

The lack of specific arithmetical axioms in Book VII has puzzled historians of mathematics. It is hardly possible in our view to ascribe to the Greeks a conscious undertaking to axiomatize arithmetic. The view that associates the beginnings of the axiomatization of arithmetic with the works of Grassman [1861], Dedekind [1888] and Peano [1889] seems to be more plausible. In this connection a number of interesting historical problems have been raised, for instance, why arithmetic was axiomatized so late. This question (...) was first posed and quite conclusively answered by Yanovskaja [1956]. Her major and quite conclusive argument was that “algorithms in arithmetic have absolute character, while in geometry we have to do with reducibility algorithms”. In this paper we are going to draw attention on certain peculiarities of the construction of the arithmetical Books of Euclid’s "Elements" and show that Euclidean arithmetic is constructed by effective procedures. In spite of the use of inference by reductio ad absurdum and methods equivalent to mathematical induction, Euclidean arithmetic retains its finitary character. It is not full arithmetic, but a finitary fragment of classical arithmetic, and thereby there was not any internal reason for its axiomatization. (shrink)

We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the logic is decidable, and give (...) a complete axiomatization. To demonstrate the value of the logic, we show in particular how it can be applied to the problem of determining whether a social choice function is strategy-proof. (shrink)

We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the logic is decidable, and give (...) a complete axiomatization. To demonstrate the value of the logic, we show in particular how it can be applied to the problem of determining whether a social choice function is strategy-proof. (shrink)

There has been much discussion on the two-envelope paradox. Clark and Shackel (2000) have proposed a solution to the paradox, which has been refuted by Meacham and Weisberg (2003). Surprisingly, however, the literature still contains no axiomatic justification for the claim that one should be indifferent between the two envelopes before opening one of them. According to Meacham and Weisberg, "decision theory does not rank swapping against sticking [before opening any envelope]" (p. 686). To fill this gap in the (...) literature, we present a simple axiomatic justification for indifference, avoiding any expectation reasoning, which is often considered problematic in infinite cases. Although the two-envelope paradox assumes an expectation-maximizing agent, we show that analogous paradoxes arise for agents using different decision principles such as maximin and maximax, and that our justification for indifference before opening applies here too. (shrink)

This volume is a collection of papers on philosophy of mathematics which deal with a series of questions quite different from those which occupied the minds of the proponents of the three classic schools: logicism, formalism, and intuitionism. The questions of the volume are not to do with justification in the traditional sense, but with a variety of other topics. Some are concerned with discovery and the growth of mathematics. How does the semantics of mathematics change as the subject develops? (...) What heuristics are involved in mathematical discovery, and do such heuristics constitute a logic of mathematical discovery? What new problems have been introduced by the development of mathematics since the 1930s? Other questions are concerned with the applications of mathematics both to physics and to the new field of computer science. Then there is the new question of whether the axiomatic method is really so essential to mathematics as is often supposed, and the question, which goes back to Wittgenstein, of the sense in which mathematical proofs are compelling. Taking these questions together they give part of an emerging agenda which is likely to carry philosophy of mathematics forward into the twenty first century. (shrink)