The semantics for counterfactuals due to David Lewis has been challenged by appealing to miracles. Miracles may skew a given similarity order in favour of those possible worlds which exhibit them. Lewis responded with a system of priorities that mitigates the significance of miracles when constructing similarity relations. We propose a prioritised ceteris paribus analysis of counterfactuals inspired by Lewis’ system of priorities. By analysing the couterfactuals with a ceteris paribus clause one forces out, in a natural manner, those (...) possible worlds which do not satisfy the requirements of the clause, thus excluding miracles. If no world can satisfy the ceteris paribus clause in its entirety, then prioritisation is triggered to select worlds that maximise agreement on those things which are favoured most. (shrink)

Syllogism is a type of everyday reasoning. For instance, given that ‘Avicenna wrote the famous book the Canon of Medicine’ and ‘The Canon of Medicine has influenced modern medicine,’ it can be conc...

Francesco Berto proposed a logic for imaginative episodes. The logic establishes certain (in)validities concerning episodic imagination. They are not all equally plausible as principles of episodic imagination. The logic also does not model that the initial input of an imaginative episode is deliberately chosen.Stit-imagination logic models the imagining agent’s deliberate choice of the content of their imagining. However, the logic does not model the episodic nature of imagination. The present paper combines the two logics, thereby (...) modelling imaginative episodes with deliberately chosen initial input. We use a combination ofstit-imagination logic and a content-sensitive variably strict conditional à la Berto, for which we give a Chellas–Segerberg semantics. The proposed semantics has the following advantages over Berto’s: (i) we model thedeliberate choiceof initial input of imaginative episodes (in a multi-agent setting), (ii) we showframe correspondencesfor axiomatic analogues of Berto’s validities, which (iii) allows thepossibility to disregard axiomsthat might be considered not plausible as principles concerning imaginative episodes. We do not take a definite stance on whether theseshouldbe disregarded but give reasons for why one might want to disregard them. Finally, we compare our semantics briefly with recent work, which aims to model voluntary imagination, and argue that our semantics models different aspects. (shrink)

In his new book, Logical Form, Andrea Iacona distinguishes between two different roles that have been ascribed to the notion of logical form: the logical role and the semantic role. These two roles entail a bifurcation of the notion of logical form. Both notions of logical form, according to Iacona, are descriptive, having to do with different features of natural language sentences. I agree that the notion of logical form bifurcates, but not that the logical role is merely descriptive. (...) In this paper, I focus on formalization, a process by which logical form, on its logical role, is attributed to natural language sentences. According to some, formalization is a form of explication, and it involves normative, pragmatic, as well as creative aspects. I present a view by which formalization involves explicit commitments on behalf of a reasoner or an interpreter, which serve the normative grounds for the evaluation of a given text. In previous work, I proposed the framework of semantic constraints for the explication of logical consequence. Here, I extend the framework to include formalization constraints. The various constraints then serve the role of commitments. I discuss specific issues raised by Iacona concerning univocality, co-reference and equivocation, and I show how our views on these matters diverge as a result of our different starting assumptions. (shrink)

We present a multi-conclusion natural deduction calculus characterizing the dynamic reasoning typical of Adaptive Logics. The resulting system AdaptiveND is sound and complete with respect to the propositional fragment of adaptive logics based on CLuN. This appears to be the first tree-format presentation of the standard linear dynamic proof system typical of Adaptive Logics. It offers the advantage of full transparency in the formulation of locally derivable rules, a connection between restricted inference-rules and their adaptive counterpart, and the (...) formulation of abnormalities as a subtype of well-formed formulas. These features of the proposed calculus allow us to clarify the relation between defeasible and multiple-conclusion approaches to classical recapture. (shrink)

Logic has its roots in the study of valid argument, but while traditional logicians worked with natural language directly, modern approaches first translate natural arguments into an artificial language. The reason for this step is that some artificial languages now have very well developed inferential systems. There is no doubt that this is a great advantage in general, but for the study of natural reasoning it is a drawback that the original linguistic forms get lost (...) in translation. An alternative approach would be to develop a general theory of the natural logic behind human reasoning and human information processing by studying formal logics that operate directly on linguistic representations. That this is possible we will try to make plausible in this paper. It will turn out that one level of representation, that of Logical Form, can meaningfully be identified with the language of an existing and well-understood logic, a restricted form of the theory of types. It is not difficult to devise inference systems for this language, and it is thus possible to study reasoning systems that are based directly on language. (shrink)

In the paper I ask the question about the relation between formal logic and the natural logic of human mind. By a natural logic I mean the ways of thinking of a person that is intelligent but untrained in formal logic. As it turns out that the laws, rules or properties of formal logic in some cases diverge from the natural ways of reasoning, I explain the causes of this divergence. Since (...) the majority of research in this area has been carried out from the standpoint of psychology, as a logician I suggest a slight change of the angle from which we look at the problem. I argue that certain narrowing of an interdisciplinary research would be helpful in getting a better picture of natural logic, and might provide a new stimulus for formal investigations. (shrink)

We present some ideas on logical process descriptions, using relations from the DIO (Drug Interaction Ontology) as examples and explaining how these relations can be naturally decomposed in terms of more basic structured logical process descriptions using terms from linear logic. In our view, the process descriptions are able to clarify the usual relational descriptions of DIO. In particular, we discuss the use of logical process descriptions in proving linear logical theorems. Among the types of reasoning supported by (...) DIO one can distinguish both (1) basic reasoning about general structures in reality and (2) the domain-specific reasoning of experts. We here propose a clarification of this important distinction between (realist) reasoning on the basis of an ontology and rule-based inferences on the basis of an expert’s view. (shrink)

The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and commonsense (...) reasoning, expert systems implementation, deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

In their useful logic for a computer network Shramko and Wansing generalize initial values of Belnap’s 4-valued logic to the set 16 to be the power-set of Belnap’s 4. This generalization results in a very specific algebraic structure — the trilattice SIXTEEN 3 with three orderings: information, truth and falsity. In this paper, a slightly different way of generalization is presented. As a base for further generalization a set 3 is chosen, where initial values are a — incoming (...) data is asserted, d — incoming data is denied, and u — incoming data is neither asserted nor denied, that corresponds to the answer “don’t know”. In so doing, the power-set of 3, that is the set 8 is considered. It turns out that there are not three but four orderings naturally defined on the set 8 that form the tetralattice EIGHT 4 . Besides three ordering relations mentioned above it is an extra uncertainty ordering. Quite predictably, the logics generated by a –order (truth order) and d –order (falsity order) coincide with first-degree entailment. Finally logic with two kinds of operations ( a –connectives and d –connectives) and consequence relation defined via a –ordering is considered. An adequate axiomatization for this logic is proposed. (shrink)

In their useful logic for a computer network Shramko and Wansing generalize initial values of Belnap’s 4-valued logic to the set 16 to be the power-set of Belnap’s 4. This generalization results in a very specific algebraic structure — the trilattice SIXTEEN3 with three orderings: information, truth and falsity. In this paper, a slightly different way of generalization is presented. As a base for further generalization a set 3 is chosen, where initial values are a — incoming data (...) is asserted, d — incoming data is denied, and u — incoming data is neither asserted nor denied, that corresponds to the answer “don’t know”. In so doing, the power-set of 3, that is the set 8 is considered. It turns out that there are not three but four orderings naturally defined on the set 8 that form the tetralattice EIGHT4. Besides three ordering relations mentioned above it is an extra uncertainty ordering. Quite predictably, the logics generated by a–order and d–order coincide with first-degree entailment. Finally logic with two kinds of operations and consequence relation defined via a–ordering is considered. An adequate axiomatization for this logic is proposed. (shrink)

This paper investigates formal logics for reasoning about determinacy and independence. Propositional Dependence Logic D and Propositional Independence Logic I are recently developed logical systems, based on team semantics, that provide a framework for such reasoning tasks. We introduce two new logics L_D and L_I, based on Kripke semantics, and propose them as alternatives for D and I, respectively. We analyse the relative expressive powers of these four logics and discuss the way these systems relate to (...) natural language. We argue that L_D and L_I naturally resolve a range of interpretational problems that arise in D and I.We also obtain sound and complete axiomatizations for L_D and L_I . (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be (...) found in human reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

In this paper we argue that normative reasons are hyperintensional and put forward a formal account of this thesis. That reasons are hyperintensional means that a reason for a proposition does not imply that it is also a reason for a logically equivalent proposition. In the first part we consider three arguments for the hyperintensionality of reasons: an argument from the nature of reasons, an argument from substitutivity and an argument from explanatory power. In the second part we describe a (...) hyperintensional logic of reasons based on justification logics. Eventually we discuss the philosophical import of this proposal and highlight some limitations and possible developments. (shrink)

Logicians have always found inspiration for new research in the ordinary language that is used on a daily basis and acquired naturally in childhood. Whereas the logical issues in the foundations of mathematics motivated the development of mathematical logic with its emphasis on notions of proof, validity, axiomatization, decidability, consistency, and completeness, the logical analysis of natural language motivated the development of philosophical logic with its emphasis on semantic notions of presupposition, entailment, modality, conditionals, and intensionality. The (...) relation between research programs in both mathematical and philosophical logic and natural language syntax and semantics as branches of theoretical linguistics has increased in importance throughout the last fifty years. This chapter reviews the development of one particularly interesting and lively area of interaction between formal logic and linguistics—the semantics of natural language. Research in this emergent field has proved fruitful for the development of empirically, cognitively adequate models of reasoning with partial information, sharing or exchanging information, dynamic interpretation in context, belief revision and other cognitive processes. (shrink)

Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major (...) milestones in the logical representation of space and investigate current trends. In doing so, we do not only consider classical logic, but we indulge ourselves with modal logics. These present themselves naturally by providing simple axiomatizations of different geometries, topologies, space-time causality, and vector spaces. (shrink)

We propose a logic for reasoning about metric spaces with the induced topologies. It combines the 'qualitative' interior and closure operators with 'quantitative' operators 'somewhere in the sphere of radius r.' including or excluding the boundary. We supply the logic with both the intended metric space semantics and a natural relational semantics, and show that the latter (i) provides finite partial representations of (in general) infinite metric models and (ii) reduces the standard '∈-definitions' of closure and (...) interior to simple constraints on relations. These features of the relational semantics suggest a finite axiomatisation of the logic and provide means to prove its EXPTIME-completeness (even if the rational numerical parameters are coded in binary). An extension with metric variables satisfying linear rational (in)equalities is proved to be decidable as well. Our logic can be regarded as a 'well-behaved' common denominator of logical systems constructed in temporal, spatial, and similarity-based quantitative and qualitative representation and reasoning. Interpreted on the real line (with its Euclidean metric), it is a natural fragment of decidable temporal logics for specification and verification of real-time systems. On the real plane, it is closely related to quantitative and qualitative formalisms for spatial representation and reasoning, but this time the logic becomes undecidable. (shrink)

The need to distinguish between logical and extra-logical varieties of inference, entailment, validity, and consistency has played a prominent role in meta-ethical debates between expressivists and descriptivists. But, to date, the importance that matters of logical form play in these distinctions has been overlooked. That’s a mistake given the foundational place that logical form plays in our understanding of the difference between the logical and the extra-logical. This essay argues that descriptivists are better positioned than their expressivist rivals to provide (...) the needed account of logical form, and so better able to capture the needed distinctions. This finding is significant for several reasons: First, it provides a new argument against expressivism. Second, it reveals that descriptivists can make use of this new argument only if they are willing to take a controversial—but plausible—stand on claims about the nature and foundations of logic. (shrink)

Efforts to formalize qualitative accounts of inference to the best explanation (IBE) confront two obstacles: the imprecise nature of such accounts and the unusual logical properties that explanations exhibit, such as contradiction-intolerance and irreflexivity. This paper aims to surmount these challenges by utilising a new, more precise theory that treats explanations as expressions that codify defeasible inferences. To formalise this account, we provide a sequent calculus in which IBE serves as an elimination rule for a connective that exhibits many of (...) the properties associated with the behaviour of the English expression ‘That... best explains why ... ’. We first construct a calculus that encodes these properties at the level of the turnstile, i.e. as a metalinguistic expression for classes of defeasible consequence relations. We then show how this calculus can be conservatively extended over a language that contains a best-explains-why operator. (shrink)

We propose a logic for reasoning about metric spaces with the induced topologies. It combines the ‘qualitative’ interior and closure operators with ‘quantitative’ operators ‘somewhere in the sphere of radiusr’ including or excluding the boundary. We supply the logic with both the intended metric space semantics and a natural relational semantics, and show that the latter (i) provides finite partial representations of (in general) infinite metric models and (ii) reduces the standard ‘ε-definitions’ of closure and interior (...) to simple constraints on relations. These features of the relational semantics suggest a finite axiomatisation of the logic and provide means to prove its EXPTIME-completeness (even if the rational numerical parameters are coded in binary). An extension with metric variables satisfying linear rational (in)equalities is proved to be decidable as well. Our logic can be regarded as a ‘well-behaved’ common denominator of logical systems constructed in temporal, spatial, and similarity-based quantitative and qualitative representation and reasoning. Interpreted on the real line (with its Euclidean metric), it is a natural fragment of decidable temporal logics for specification and verification of real-time systems. On the real plane, it is closely related to quantitative and qualitative formalisms for spatial representation and reasoning, but this time the logic becomes undecidable. (shrink)

We propose a logic of abduction that (i) provides an appropriate formalization of the explanatory conditional, and that (ii) captures the defeasible nature of abductive inference. For (i), we argue that explanatory conditionals are non-classical, and rely on Brian Chellas’s work on conditional logics for providing an alternative formalization of the explanatory conditional. For (ii), we make use of the adaptive logics framework for modeling defeasible reasoning. We show how our proposal allows for a more natural reading (...) of explanatory relations, and how it overcomes problems faced by other systems in the literature. (shrink)

In the 17th century, Hobbes stated that we reason by addition and subtraction. Historians of logic note that Hobbes thought of reasoning as “a ‘species of computation’” but point out that “his writing contains in fact no attempt to work out such a project.” Though Leibniz mentions the plus/minus character of the positive and negative copulas, neither he nor Hobbes say anything about a plus/minus character of other common logical words that drive our deductive judgments, words like ‘some’, (...) ‘all’, ‘if’, and ‘and’, each of which actually turns out to have an oppositive, character that allows us, “in our silent reasoning,” to ignore its literal meaning and to reckon with it as one reckons with a plus or a minus operator in elementary algebra or arithmetic. These ‘logical constants’ of natural language figure crucially in our everyday reasoning. Because Hobbes and Leibniz did not identify them as the plus and minus words we reason with, their insight into what goes on in ‘ratiocination’ did not provide a guide for a research program that could develop a +/- logic that actually describes how we reason deductively. I will argue that such a +/- logic provides a way back from modern predicate logic—the logic of quantifiers and bound variables that is now ‘standard logic’—to an Aristotelian term logic of natural language that had been the millennial standard logic. (shrink)

The theories of belief change developed within the AGM-tradition are not logics in the proper sense, but rather informal axiomatic theories of belief change. Instead of characterizing the models of belief and belief change in a formalized object language, the AGM-approach uses a natural language — ordinary mathematical English — to characterize the mathematical structures that are under study. Recently, however, various authors such as Johan van Benthem and Maarten de Rijke have suggested representing doxastic change within a formal (...) logical language: a dynamic modal logic. Inspired by these suggestions Krister Segerberg has developed a very general logical framework for reasoning about doxastic change: dynamic doxastic logic (DDL). This framework may be seen as an extension of standard Hintikka-style doxastic logic with dynamic operators representing various kinds of transformations of the agent's doxastic state. Basic DDL describes an agent that has opinions about the external world and an ability to change these opinions in the light of new information. Such an agent is non-introspective in the sense that he lacks opinions about his own belief states. Here we are going to discuss various possibilities for developing a dynamic doxastic logic for introspective agents: full DDL or DDL unlimited. The project of constructing such a logic is faced with difficulties due to the fact that the agent’s own doxastic state now becomes a part of the reality that he is trying to explore: when an introspective agent learns more about the world, then the reality he holds beliefs about undergoes a change. But then his introspective (higher-order) beliefs have to be adjusted accordingly. In the paper we shall consider various ways of solving this problem. (shrink)

In this paper we address the modelling of reasoning processes in natural agents. We focus on a very basic kind of non-monotonic inference for which we identify a simple and plausible underlying process, and we develop a family of logical models that allow to match this process. Partial worlds models, as we call them, are a variant of Kraus, Lehmann and Magidor’s cumulative models. We show that the inference relations they induce form a strict subclass of cumulative relations (...) and tackle the issue of providing sound and complete sets of rules to characterise them. Taking inspiration from the work of Gabbay and Schlechta, we analyse the question in terms of definable sets of partial worlds and conclude that completeness is probably unreachable using a standard propositional language. This brings us to enrich our language with an additional connective, which makes it possible to distinguish between two kinds of disjunction in the partial worlds context. Within this renewed framework, we provide two representation theorems: one for inference relations induced by precisification-free smooth models, and the other for inference relations induced by precisification-free ranked models. Finally we give an aperçu of how partial worlds models lend themselves to the modelling of learning. (shrink)

This paper presents a formalism that combines useful properties of both logic and probabilities. Like logic, the formalism admits qualitative sentences and provides symbolic machinery for deriving deductively closed beliefs and, like probability, it permits us to express if-then rules with different levels of firmness and to retract beliefs in response to changing observations. Rules are interpreted as order-of-magnitude approximations of conditional probabilities which impose constraints over the rankings of worlds. Inferences are supported by a unique priority ordering (...) on rules which is syntactically derived from the knowledge base. This ordering accounts for rule interactions, respects specificity considerations and facilitates the construction of coherent states of beliefs. Practical algorithms are developed and analyzed for testing consistency, computing rule ordering, and answering queries. Imprecise observations are incorporated using qualitative versions of Jeffrey's rule and Bayesian updating, with the result that coherent belief revision is embodied naturally and tractably. Finally, causal rules are interpreted as imposing Markovian conditions that further constrain world rankings to reflect the modularity of causal organizations. These constraints are shown to facilitate reasoning about causal projections, explanations, actions and change. (shrink)

I consider the question of how literally one can construe the “gauge argument,” which is the canonical means of understanding the putatively central import of local gauge symmetry principles for fundamental physics. As I argue, the gauge argument must be afforded a heuristic reading. Claims to the effect that the argument reflects a deep “logic of nature” must, for numerous reasons I discuss, be taken with a grain of salt.

I consider the question of how literally one can construe the “gauge argument,” which is the canonical means of understanding the putatively central import of local gauge symmetry principles for fundamental physics. As I argue, the gauge argument must be afforded a heuristic reading. Claims to the effect that the argument reflects a deep “logic of nature” must, for numerous reasons I discuss, be taken with a grain of salt.

The philosophy of nature has become virtually an oxymoron for the prevailing philosophical consensus. Reason, we are told, is powerless to conceive what nature is in itself but must instead hand over all understanding of physical reality to empirical science. Philosophy may reflect upon how natural science models its data, scrutinizing the consistency of scientific theories and the way research projects are framed, but reason must never go beyond its frail limits to provide a priori ampliative, synthetic knowledge of (...) what holds universally and necessarily of nature. Insofar as the problems of knowing nature a priori apply to any extension of a priori knowledge beyond reason’s knowledge of itself, philosophy should .. (shrink)

A common reaction to Hegel’s suggestion that we collapse Kant’s distinction between form and content is that, since such a move would also deprive us of any way of distinguishing the merely logical from the real possibility of our concepts, it is incoherent and ought to be rejected. It is true that these two distinctions are intimately related in Kant, such that if one goes, the other does as well. But it is less obvious that giving them up as Kant (...) conceives them is as incoherent a proposal as many of Hegel’s critics think. It has been the point of a recent account of Hegel’s idealism to demonstrate that his critique of Kant’s dichotomy between form and content or concept and intuition does not commit him to the view that human cognition is materially creative of its content in the manner of a God-like or intuitive intellect—does not, in other words, signify a return to a pre-Critical metaphysics. This is the interpretative stance I adopt here as well, in hope of giving defenders of Kant reasons for taking Hegel more seriously. (shrink)

The study of some real reasonings (observed in the Humanities) reveals the very heterogeneous nature of the arguments used in the building of scientific knowledge and the complexity of their overall architecture. The building of a formal theory of the trace of these mental processes on the classical grounds of logic seems quite impossible. Instead, we propose a flexible methodology based on some local formal models, integrated in a global strategy. This strategy allows an empirical, but systematic, description of (...) the process of reasoning as a whole.The local models can be very different, from plausible inference to conditional transitivity. Their integration is based on some argumentative markers or structures (topoï). We propose a procedural semantics for some of them.This paper is based on the AVEROES Project, a study of the sea-borne trade in the Occidental Mediterranean Sea during the Roman Empire. (shrink)

The negation constitutes one of the main troubles for attempts to naturalise the semantics of the logical vocabulary, as shown by the problems related to the interpretation of disjunction in the treatment of error (Fodor) or to the definition of contraries in the analysis of reidentification abilities (Millikan). There seems to be no way out between “no (naturalized) negation, no grip of logic on the world” and “no (truth-functional) negation, no logic”. Unexpected help may come from the cognitive (...) phenomenology of negation. For three reasons: • Firstly, because it allows a distinction to be made between semantic analysis, identification of the possession conditions and psychology of the acquisition of the notion of negation, a distinction whose absence produces many misunderstandings between those who support a naturalization of semantics and those who oppose it. • Then because it places negation at the level of the contrast between beliefs, a terrain that is hostile to some naturalizers. • Finally, because it makes it possible to define a peculiar type of liberalised naturalization of semantics and, consequently, to present a hypothesis for the naturalization of cognitive phenomenology. (shrink)

The central hypothesis of the collaboration between Language and Computing (L&C) and the Institute for Formal Ontology and Medical Information Science (IFOMIS) is that the methodology and conceptual rigor of a philosophically inspired formal ontology greatly benefits application ontologies. To this end r®, L&C’s ontology, which is designed to integrate and reason across various external databases simultaneously, has been submitted to the conceptual demands of IFOMIS’s Basic Formal Ontology (BFO). With this project we aim to move beyond the level of (...) controlled vocabularies to yield an ontology with the ability to support reasoning applications. Our general procedure has been the implementation of a meta-ontological definition space in which the definitions of all the concepts and relations in LinKBase® are standardized in a framework of first-order logic. In this paper we describe how this standardization has already led to an improvement in the LinKBase® structure that allows for a greater degree of internal coherence than ever before possible. We then show the use of this philosophical standardization for the purpose of mapping external databases to one another, using LinKBase® as translation hub, with a greater degree of success than possible hitherto. We demonstrate how this offers a genuine advance over other application ontologies that have not submitted themselves to the demands of philosophical scrutiny. LinKBase® is one of the world’s largest applications-oriented medical domain ontologies, and BFO is one of the world’s first philosophically driven reference ontologies. The collaboration of the two thus initiates a new phase in the quest to solve the so-called “Tower of Babel”. (shrink)

In Schelling’s “On the Relation between the Real and the Ideal in Nature", not only does the titular copula bond real and ideal, but it is itself bonded in and by nature. If the copula doesn't merely bond nature and judgment, but bonds the latter to the former as an instance of the nature from which is derives, what relation does the essay's search for nature's primals bear to the universalism of logical law? What, moreover, is the relation of the (...) copula to its environing nature? I here aim to explore the claim that, for Schelling, something is logically exhibited when the nature in the judgment differs for that reason from the nature in which it is itself contained or conceived. (shrink)

According to Kant, the division of the categories “is not the result of a search after pure concepts undertaken at haphazard,” but is derived from the “complete” classification of judgments developed by traditional logic. However, the sorts of judgments that he enumerates in his table of judgments are not all ones that traditional logic has dealt with; consequently, we must say that he chose the sorts of judgments in question with a certain intention. Besides, we know that his (...) choice of judgments and categories is strongly influenced by certain views of natural science that he fully accepts. For this reason, his argumentations are sometimes seriously inconsistent. As to Kant’s argumentations of categories, many problems have already been pointed out, but in this paper, I take up the categories of quantity and quality once more, and make clear his argumentations’ hidden logic and its distortion from the point of view of the history of logic and natural science. First, I confirm that there are non-negligible problems in his explanation to the effect that his derivation of the categories of quantity and quality is based on the quantity and quality of judgments. Next, I reconsider the meaning of his treating the categories of quantity and quality as pure concepts of the understanding. Finally, I conclude that by having recourse to the categories of quantity and quality Kant tried unjustly to apriorize the distinction between the “extensive magnitude” and “intensive magnitude” that has a long formational history since Aristotle. (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)

Provability logics with many modal operators for progressions of theories obtained by iterating their consistency statements are introduced. The corresponding arithmetical completeness theorem is proved.

It is a popular view thatpractical deliberation excludes foreknowledge of one's choice. Wolfgang Spohn and Isaac Levi have argued that not even a purely probabilistic self-predictionis available to thedeliberator, if one takes subjective probabilities to be conceptually linked to betting rates. It makes no sense to have a betting rate for an option, for one's willingness to bet on the option depends on the net gain from the bet, in combination with the option's antecedent utility, rather than on the offered (...) odds. And even apart from this consideration, assigning probabilities to the options among which one is choosing is futile since such probabilities could be of no possible use in choice. The paper subjects these arguments to critical examination and suggests that, appearances notwithstanding, practical deliberation need not crowd outself-prediction. (shrink)

The article presents the first results we have obtained studying natural reasoning from a proof-theoretic perspective. In particular we focus our attention on monotonic reasoning. Our system consists of two parts: (i) A Formal Grammar – a multimodal version of classical Categorial Grammar – which while syntactically analysing linguistic expressions given as input, computes semantic information (In particular information about the monotonicity properties of the components of the input string are displayed.); (ii) A simple Natural (...) class='Hi'>Logic which derives (monotonicity) inferences using as vehicle the parsed output. The monotonicity markers assigned in the lexicon are propagated through the proofs via a combination of the structural and the logical rules for the unary operators of Multimodal Categorial Grammar (MMCG) [Moo97]. We have chosen to work with an expressive ‘grammar logic’, in order to avoid the use of extra-logical marking devices and extra-logical structural reasoning. Having MMCG as parser, our system is able to make the derivations simply within the logic. This new approach makes the implementation of the theory an easier task. We have implemented the theoretical results, so far obtained, using Grail, a theorem prover for Categorial Grammar Logics [Moo98]. (shrink)

This book examines two questions: Do people make use of abstract rules such as logical and statistical rules when making inferences in everyday life? Can such abstract rules be changed by training? Contrary to the spirit of reductionist theories from behaviorism to connectionism, there is ample evidence that people do make use of abstract rules of inference -- including rules of logic, statistics, causal deduction, and cost-benefit analysis. Such rules, moreover, are easily alterable by instruction as it occurs in (...) classrooms and in brief laboratory training sessions. The fact that purely formal training can alter them and that those taught in one content domain can "escape" to a quite different domain for which they are also highly applicable shows that the rules are highly abstract. The major implication for cognitive science is that people are capable of operating with abstract rules even for concrete, mundane tasks; therefore, any realistic model of human inferential capacity must reflect this fact. The major implication for education is that people can be far more broadly influenced by training than is generally supposed. At high levels of formality and abstraction, relatively brief training can alter the nature of problem-solving for an infinite number of content domains. (shrink)

We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the definition of monotonicity preserving and monotonicity reversing functions in terms of ≤. Next, we present a new algorithm for polarity marking, and implement this for a particular fragment of syntax. Finally, we list the reseach agenda that these definitions and this algorithm suggest. The implementations use Haskell [8], and are (...) given in ‘literate programming’ style [9]. (shrink)

Gentzen writes in the published version of his doctoral thesis Untersuchungen über das logische Schliessen that he was able to prove the normalization theorem only for intuitionistic natural deduction, but not for classical. To cover the latter, he developed classical sequent calculus and proved a corresponding theorem, the famous cut elimination result. Its proof was organized so that a cut elimination result for an intuitionistic sequent calculus came out as a special case, namely the one in which the sequents (...) have at most one formula in the right, succedent part. Thus, there was no need for a direct proof of normalization for intuitionistic natural deduction. The only traces of such a proof in the published thesis are some convertibilities, such as when an implication introduction is followed by an implication elimination [1934–35, II.5.13]. It remained to Dag Prawitz in 1965 to work out a proof of normalization. Another, less known proof was given also in 1965 by Andres Raggio.We found in February 2005 an early handwritten version of Gentzen's thesis, with exactly the above title, but with rather different contents: Most remarkably, it contains a detailed proof of normalization for what became the standard system of natural deduction. The manuscript is located in the Paul Bernays collection at the ETH-Zurichwith the signum Hs. 974: 271. Bernays must have gotten it well before the time of his being expelled from Göttingen on the basis of the racial laws in April 1933. (shrink)

A formal, computational, semantically clean representation of natural language is presented. This representation captures the fact that logical inferences in natural language crucially depend on the semantic relation of entailment between sentential constituents such as determiner, noun, adjective, adverb, preposition, and verb phrases.The representation parallels natural language in that it accounts for human intuition about entailment of sentences, it preserves its structure, it reflects the semantics of different syntactic categories, it simulates conjunction, disjunction, and negation in (...) class='Hi'>natural language by computable operations with provable mathematical properties, and it allows one to represent coordination on different syntactic levels. (shrink)

This paper explores the question of what logic is not. It argues against the wide spread assumptions that logic is: a model of reason; a model of correct reason; the laws of thought, or indeed is related to reason at all such that the essential nature of the two are crucially or essentially co-illustrative. I note that due to such assumptions, our current understanding of the nature of logic itself is thoroughly entangled with the nature of reason. (...) I show that most arguments for the presence of any sort of essential re- lationship between logic and reason face intractable problems and demands, and fall well short of addressing them. These arguments include those for the notion that logic is normative for reason (or that logic and correct reason are in some way the same thing), that logic is some sort of description of correct reason and that logic is an abstracted or idealised version of correct reason. A strong version of logical realism is put forward as an alternative view, and is briefly explored. (shrink)

An Invitation to Formal Reasoning introduces the discipline of formal logic by means of a powerful new system formulated by Fred Sommers. This system, term logic, is different in a number of ways from the standard system employed in modern logic; most striking is its greater simplicity and naturalness. Based on a radically different theory of logical syntax than the one Frege used when initiating modern mathematical logic in the 19th Century, term logic borrows (...) insights from Aristotle's syllogistic, Scholastic logicians, Leibniz, and the 19th century British algebraists. Term logic takes its syntax directly from natural language, construing statements as combinations of pairs of terms, where complex terms are taken to have the same syntax as statements. Whereas standard logic requires extensive 'translation' from natural language to symbolic language, term logic requires only 'transcription' into the symbolic language. Its naturalness is the result of its ability to stay close to the forms of sentences usually found in every day discourse. Written by the founders of the term logic approach, An Invitation to Formal Reasoning is a unique introduction and exploration of this new system, offering numerous exercises and examples throughout the text. Summarising the standard system of mathematical logic to set term logic in context, and showing how the two systems compare, this book presents an alternative approach to standard modern logic for those studying formal logic, philosophy of language or computer theory. Fred Sommers is Professor Emeritus, Brandeis University, USA; George Englebretsen is Professor of Philosophy, Bishop's University, Canada. (shrink)

In this paper we explore differences in use of the so-called ‘logical’ elements of language such as quantifiers and conditionals, and use this to explain differences in performance in reasoning tasks across subject groups with different educational backgrounds. It is argued that quantified sentences are difficult natural bases for reasoning, and hence more prone to elicit variation in reasoning behaviour, because they are chiefly used with a pre-determined domain in everyday speech. By contrast, it is argued (...) that conditional sentences form natural premises because of the function they serve in everyday speech. Implications of this for the role of logic in modelling human reasoning behaviour are briefly considered. (shrink)