Second-order Logic and the Power Set

Ignacio Jane has argued that second-order logic presupposes some amount of set theory and hence cannot legitimately be used in axiomatizing set theory. I focus here on his claim that the second-order formulation of the Axiom of Separation presupposes the character of the power set operation, thereby preventing a thorough study of the power set of infinite sets, a central part of set theory. In reply I argue that substantive issues often cannot be separated from a logic, but rather must be presupposed. I call this the logic-metalogic link. There are two facets to the logic-metalogic link. First, when a logic is entangled with a substantive issue, the same position on that issue should be taken at the meta- level as at the object level; and second, if an expression has a clear meaning in natural language, then the corresponding concept can equally well be deployed in a formal language. The determinate nature of the power set operation is one such substantive issue in set theory. Whether there is a determinate power set of an infinite set can only be presupposed in set theory, not proved, so the use of second-order logic cannot be ruled out by virtue of presupposing one answer to this question. Moreover, the legitimacy of presupposing in the background logic that the power set of an infinite set is determinate is guaranteed by the clarity and definiteness of the notions of all and of subset. This is also exactly what is required for the same presupposition to be legitimately made in an axiomatic set theory, so the use of second-order logic in set theory rather than first-order logic does not require any new metatheoretic commitments.     

Johnson and the Soundness Doctrine

Why informal logic? Informal logic is a group of proposals meant to contrast with, replace, and reject formal logic, at least for the analysis and evaluation of everyday arguments. Why reject formal logic? Formal logic is criticized and claimed to be inadequate because of its commitment to the soundness doctrine. In this paper I will examine and try to respond to some of these criticisms. It is not my aim to examine every argument ever given against formal logic; I am limiting myself to those that, as a matter of historical fact, were instrumental in the replacement of formal logic by informal logic and initially established informal logic as a separate discipline (in particular, Toulmin’s attacks on what he calls the “analytic ideal” will not form part of the discussion and were not instrumental in this way, only becoming appreciated later). If the criticism of the soundness doctrine is defective, then the move from formal logic to informal logic was not theoretically well-motivated. It is this motivation that I wish to bring into question, rather than the adequacy or inadequacy of formal or informal logic as such. While I will tend to the view that formal logic is as adequate as it is reasonable to expect, the real issue is whether it is inadequate for the reasons that, as a matter of historical fact, were used to motivate its rejection.     

Logic and Ontology

A brief review of the historicalrelation between logic and ontologyand of the opposition between the viewsof logic as language and logic as calculusis given. We argue that predication is morefundamental than membership and that differenttheories of predication are based on differenttheories of universals, the three most importantbeing nominalism, conceptualism, and realism.These theories can be formulated as formalontologies, each with its own logic, andcompared with one another in terms of theirrespective explanatory powers. After a briefsurvey of such a comparison, we argue that anextended form of conceptual realism provides themost coherent formal ontology and, as such, canbe used to defend the view of logic as language.     

A Logic For Inductive Probabilistic Reasoning

Inductive probabilistic reasoning is understood as the application of inference patterns that use statistical background information to assign (subjective) probabilities to single events. The simplest such inference pattern is direct inference: from “70% of As are Bs” and “a is an A” infer that a is a B with probability 0.7. Direct inference is generalized by Jeffrey’s rule and the principle of cross-entropy minimization. To adequately formalize inductive probabilistic reasoning is an interesting topic for artificial intelligence, as an autonomous system acting in a complex environment may have to base its actions on a probabilistic model of its environment, and the probabilities needed to form this model can often be obtained by combining statistical background information with particular observations made, i.e., by inductive probabilistic reasoning. In this paper a formal framework for inductive probabilistic reasoning is developed: syntactically it consists of an extension of the language of first-order predicate logic that allows to express statements about both statistical and subjective probabilities. Semantics for this representation language are developed that give rise to two distinct entailment relations: a relation ⊨ that models strict, probabilistically valid, inferences, and a relation that models inductive probabilistic inferences. The inductive entailment relation is obtained by implementing cross-entropy minimization in a preferred model semantics. A main objective of our approach is to ensure that for both entailment relations complete proof systems exist. This is achieved by allowing probability distributions in our semantic models that use non-standard probability values. A number of results are presented that show that in several important aspects the resulting logic behaves just like a logic based on real-valued probabilities alone.     

On the Logic of Nonmonotonic Conditionals and Conditional Probabilities: Predicate Logic

In a previous paper I described a range of nonmonotonic conditionals that behave like conditional probability functions at various levels of probabilistic support. These conditionals were defined as semantic relations on an object language for sentential logic. In this paper I extend the most prominent family of these conditionals to a language for predicate logic. My approach to quantifiers is closely related to Hartry Field's probabilistic semantics. Along the way I will show how Field's semantics differs from a substitutional interpretation of quantifiers in crucial ways, and show that Field's approach is closely related to the usual objectual semantics. One of Field's quantifier rules, however, must be significantly modified to be adapted to nonmonotonic conditional semantics. And this modification suggests, in turn, an alternative quantifier rule for probabilistic semantics.     

Convex MV-Algebras: Many-Valued Logics Meet Decision Theory

This paper introduces a logical analysis of convex combinations within the framework of ?ukasiewicz real-valued logic. This provides a natural link between the fields of many-valued logics and decision theory under uncertainty, where the notion of convexity plays a central role. We set out to explore such a link by defining convex operators on MV-algebras, which are the equivalent algebraic semantics of ?ukasiewicz logic. This gives us a formal language to reason about the expected value of bounded random variables. As an illustration of the applicability of our framework we present a logical version of the Anscombe–Aumann representation result.     

三值量子逻辑进路探析

量子测量实验显示部分经典逻辑规则在量子世界中失效。标准量子逻辑进路通过特有的希尔伯特空间的格运算揭示出一种内在于微观物理学理论的概念框架结构,也即量子力学测量命题的正交补模或弱模格,解释了经典分配律的失效,它在形式化方面十分完美,但在解释方面产生了一些概念混乱。在标准量子逻辑进路之外,赖欣巴赫通过引入"不确定"的第三真值独立地提出一种不同的量子逻辑模型来解释量子实在的特征,不是分配律而是排中律失效,但是他的三值量子逻辑由于缺乏标准量子逻辑的上述优点而被认为与量子力学的概率空间所要求的潜在逻辑有很少联系。本文尝试引入一种新的三值逻辑模型来说明量子实在,它有以下优点:(1)满足卢卡西维茨创立三值逻辑的最初语义学假定;(2)克服赖欣巴赫三值量子逻辑的缺陷;(3)澄清标准量子逻辑遭遇的概念混乱;(4)充分地保留经典逻辑规则,特别是标准量子逻辑主张放弃的分配律。     

Elementary categorial logic,predicates of variable degree,and theory of quantity

Developing some suggestions of Ramsey (1925), elementary logic is formulated with respect to an arbitrary categorial system rather than the categorial system of Logical Atomism which is retained in standard elementary logic. Among the many types of non-standard categorial systems allowed by this formalism, it is argued that elementary logic with predicates of variable degree occupies a distinguished position, both for formal reasons and because of its potential value for application of formal logic to natural language and natural science. This is illustrated by use of such a logic to construct a theory of quantity which is argued to be scientifically superior to existing theories of quantity based on standard categorial systems, since it yields realvalued scales without the need for unrealistic existence assumptions. This provides empirical evidence for the hypothesis that the categorial structure of the physical world itself is non-standard in this sense.I would like to thank my collegue Mark Brown and an anonymous referee for helpful comments on an earlier draft of this paper.     

Applied Logic without Psychologism

Logic is a celebrated representation language because of its formal generality. But there are two senses in which a logic may be considered general, one that concerns a technical ability to discriminate between different types of individuals, and another that concerns constitutive norms for reasoning as such. This essay embraces the former, permutation-invariance conception of logic and rejects the latter, Fregean conception of logic. The question of how to apply logic under this pure invariantist view is addressed, and a methodology is given. The pure invariantist view is contrasted with logical pluralism, and a methodology for applied logic is demonstrated in remarks on a variety of issues concerning non-monotonic logic and non-monotonic inference, including Charles Morgan’s impossibility results for non-monotonic logic, David Makinson’s normative constraints for non-monotonic inference, and Igor Douven and Timothy Williamson’s proposed formal constraints on rational acceptance.     

The Logic and Meaning of Plurals. Part II

In this sequel to “The logic and meaning of plurals. Part I”, I continue to present an account of logic and language that acknowledges limitations of singular constructions of natural languages and recognizes plural constructions as their peers. To this end, I present a non-reductive account of plural constructions that results from the conception of plurals as devices for talking about the many. In this paper, I give an informal semantics of plurals, formulate a formal characterization of truth for the regimented languages that results from augmenting elementary languages with refinements of basic plural constructions of natural languages, and account for the logic of plural constructions by characterizing the logic of those regimented languages.

Logic and contingent existence

It is argued here that Prior's non-standard modal system Q, and the Parry–Dunn system of analytic implication, though entirely independent and independently motivated systems, together provide a rationale for explicating the concept of validity in a non-standard way; their implications are explored for the theory of natural deduction as well as for modal logic and the concept of entailment. I give an account of formal logic from this non-standard viewpoint, together with an informal presentation of the system that unites the insights of Prior (drawing on Russell) and, Parry (drawing on Kant), and the motivations for both in the concept of the contingent existence – as opposed to the contingent truth or falsehood – of a proposition.     

Stability and Paradox in Algorithmic Logic

There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally.     

Formalization of Reliability Block Diagrams in Higher-order Logic

Reliability Block Diagrams (RBDs) allow us to model the failure relationships of complex systems and their sub-components and are extensively used for system reliability, availability and maintainability analyses. Traditionally, these RBD-based analyses are done using paper-and-pencil proofs or computer simulations, which cannot ascertain absolute correctness due to their inaccuracy limitations. As a complementary approach, we propose to use the higher-order logic theorem prover HOL to conduct RBD-based analysis. For this purpose, we present a higher-order logic formalization of commonly used RBD configurations, such as series, parallel, parallel-series and series-parallel, and the formal verification of their equivalent mathematical expressions. A distinguishing feature of the proposed RBD formalization is the ability to model nested RBD configurations, which are RBDs having blocks that also represent RBD configurations. This generality allows us to formally analyze the reliability of many real-world systems. For illustration purposes, we formally analyze the reliability of a generic Virtual Data Center (VDC) in a cloud computing infrastructure exhibiting the nested series-parallel RBD configuration.     

形式化量子力学不必使用量子逻辑

一般认为,标准量子力学需要使用一套它自己的逻辑系统,即量子逻辑。量子逻辑采用与一般逻辑系统不同的语义规则,因此和古典逻辑无法兼容。此篇文章将呈现一套量子力学的严格形式基础,它是对古典二值逻辑之保守扩充;保守扩充意指比原先之逻辑系统强,但较强的原因为它有较多之词汇。此套逻辑为三值逻辑。古典逻辑中为真的句子仍然为真。古典逻辑中为假的句子将被区分为强性假与中性。第三个真值一中性一考虑了非本征态情况中之观察句。本文详列了物理的公理并显示它们具有一个模型。此提案的可行性说明了量子逻辑是不必要的,并且存在一个共同的逻辑架构可提供给数学、非量子物理及量子力学使用。     

A Realist Analysis of the Relationship between Logic and Experience

I undertake to explain how the well known laws of formal logic – Barbara Syllogism, modus ponens, etc. – relate to experience by developing Edmund Husserl's critique ofFormalism and Psychologism in logical theory and then briefly explaining his positive views of the laws of logic. His view rests upon his understanding of the proposition as a complex, intentional property. The laws of formal logic are, on his view (and mine), statements about the truth values of propositions as determined by their formal character and relationships alone. The laws thus understood explain how algorithms set up to mirror them can accomplish what they do to advance knowledge, even though they operate purely mechanically. Further, they explain the proper sense in which formal laws "govern," and may guide, processes of actual thinking. Husserl's theory is a realist theory in the sense that, on his interpretation, the laws of pure or formal logic hold true regardless of what any individual, culture or species may or may not think, or even if no thinking ever occurs. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Modal Logic of Metaphor

The purpose of this paper is to suggest a formal modelling of metaphors as a lingustic tool capable of conveying meanings from one conceptual space to another. This modelling is done within DDL (dynamic doxastic logic).     

Extended Quantum Logic

The concept of quantum logic is extended so that it covers a more general set of propositions that involve non-trivial probabilities. This structure is shown to be embedded into a multi-modal framework, which has desirable logical properties such as an axiomatization, the finite model property and decidability.     

BH-CIFOL: Case-Intensional First Order Logic

This paper follows Part I of our essay on case-intensional first-order logic (CIFOL; Belnap and Müller (2013)). We introduce a framework of branching histories to take account of indeterminism. Our system BH-CIFOL adds structure to the cases, which in Part I formed just a set: a case in BH-CIFOL is a moment/history pair, specifying both an element of a partial ordering of moments and one of the total courses of events (extending all the way into the future) that that moment is part of. This framework allows us to define the familiar Ockhamist temporal/modal connectives, most notably for past, future, and settledness. The novelty of our framework becomes visible in our discussion of substances in branching histories, i.e., in its first-order part. That discussion shows how the basic idea of tracing an individual thing from case to case via an absolute property is applicable in a branching histories framework. We stress the importance of keeping apart extensionality and moment-definiteness, and give a formal account of how the specification of natural sortals and natural qualities turns out to be a coordination task in BH-CIFOL. We also provide a detailed answer to Lewis’s well-known argument against branching histories, exposing the fallacy in that argument.     

Incompatibility Semantics from Agreement

In this paper, I discuss the analysis of logic in the pragmatic approach recently proposed by Brandom. I consider different consequence relations, formalized by classical, intuitionistic and linear logic, and I will argue that the formal theory developed by Brandom, even if provides powerful foundational insights on the relationship between logic and discursive practices, cannot account for important reasoning patterns represented by non-monotonic or resource-sensitive inferences. Then, I will present an incompatibility semantics in the framework of linear logic which allow to refine Brandom’s concept of defeasible inference and to account for those non-monotonic and relevant inferences that are expressible in linear logic. Moreover, I will suggest an interpretation of discursive practices based on an abstract notion of agreement on what counts as a reason which is deeply connected with linear logic semantics.