The general aim of this book is to provide an elementary exposition of some basic concepts in terms of which both classical and non-dassicallogirs may be studied and appraised. Although quantificational logic is dealt with briefly in the last chapter, the discussion is chiefly concemed with propo gjtional cakuli. Still, the subject, as it stands today, cannot br covered in one book of reasonable length. Rather than to try to include in the volume as much as possible, I have put (...) emphasis on some selected topics. Even these could not be roverrd completely, but for each topic I have attempted to present a detailed and precise t’Xposition of several basic results including some which are non-trivial. The roots of some of the central ideas in the volume go back to J. Luka siewicz’s seminar on mathematicallogi. (shrink)

As Chinese Studies in Philosophy enters its twenty-fifth year, we wish to thank the editor since its inception, Professor Cheng Chung-ying of the University of Hawaii, for his many years of service, and to welcome with this issue our new editor, Professor Michael Schoenhals of Stockholm University.

I shall assume that the reader is familiar with the notions dened in [2] and [3]. A consequence C dened over a propositional language L will be said to be d-structural i the consequence dC dual with respect to C is structural. The following propositions holds true.

Tarski’s papers, in which he examines the idea of a consequence operation Cn,divide into two groups. One of them is formed by the papers that offer an analysis of the general idea of the consequence operation. Resorting to fundamental ideas of logical semantics, Tarski explains what, in his view, it means to say that a formula a of a language L is a logical consequence Cn of a set of formulas X of that language. Under the definition he proposed Cn (...) is the strongest operation on sets of formulas of L that preserves truth under all possible interpretations of the language. In the papers belonging to the second group , the consequence operation Cn is treated as an object of abstract studies. More specifically, it is treated as an abstract unary operation defined on the power set of a set S such that the following familiar conditions are satisfied: T1.X⊆Cn)⊆Cnand T2.IfX⊂YthenCn⊂CnActually, Tarski imposed on Cn one more requirement which in more recent investigations is often omitted. It is as follows: T3.Ifα∈Cn,thenforafinitesubsetX′⊆X,α∈Cn is known as the finitaryness condition. (shrink)

The two main points of this contribution are the following: (1) Applied mathematical theories might complement physical theories in an essential way; some applied mathematical theories allow us to understand phenomena we are unable to explain by resorting to physical theories alone, (2) In the case of social sciences it might be necessary to account for examined phenomena by resorting to the idea of goal-oriented activity (the causal approach typical for natural science might be unsatisfactory). Weinberg's idea of grand reductionism (...) ignores the two above mentioned facts and hence overestimates the foundational role of physics and its methodology. (shrink)

Ryszard Wójcicki's book „Ajdukiewicz. A Theory of Meaning” opens a series of publications Filozofia polska XX wieku [Polish Philosophy of XXth Century], created by Wójcicki. The main subject of the book is a theory of the meaning of linguistic expressions, which was formulated in the thirties and is known as a directival theory of meaning. The aim that the author has set for himself is not only to present and popularise that theory (these aims are implied by the character of (...) the series), but also the evaluation of its material adequacy and its significance for further investigations of language as a means of representation and transmission of knowledge. Adam Nowaczyk tries to show that Wójcicki's critique of Ajdukiewicz's conception is unjustified, for the fallacy allegedly committed in this conception is either only apparent or else easily remediable. Wójcicki disagrees with Nowaczyk's objection. (shrink)

The title of this paper is a theorem, which I am going to state and prove. The theorem extends from prepositional to predicate languages the result I presented in [5].

The title of this paper is a theorem, which I am going to state and prove. The theorem extends from prepositional to predicate languages the result I presented in [5].

This paper was written with two aims in mind. A large part of it is just an exposition of Tarski's theory of truth. Philosophers do not agree on how Tarski's theory is related to their investigations. Some of them doubt whether that theory has any relevance to philosophical issues and in particular whether it can be applied in dealing with the problems of philosophy (theory) of science.In this paper I argue that Tarski's chief concern was the following question. Suppose a (...) language L belongs to the class of languages for which, in full accordance with some formal conditions set in advance, we are able to define the class of all the semantic interpretations the language may acquire. Every interpretation of L can be viewed as a certain structure to which the expressions of the language may refer. Suppose that a specific interpretation of the language L was singled out as the intended one. Suppose, moreover, that the intended interpretation can be characterized in a metalanguage L +. If the above assumptions are satisfied, can the notion of truth for L be defined in the metalanguage L + and, if it can, how can this be done? (shrink)

An axiomatic theory of non-monotonic consequence relations patterned upon some finitistic ideas going back to Gentzen was suggested by Gabbay [1985]. 1 More recently, an infinitistic approach patterned upon Tarski’s theory of consequence operation was examined by Makinson [l98.]. We compare the two approaches and examine them vis-`a-vis some intuitive adequacy conditions. An enlarged version of this note will appear in Studia Logica , in particular the reader is referred to it for the proofs of the results stated here.

A layman's guide to the mechanics of Gödel's proof together with a lucid discussion of the issues which it raises. Includes an essay discussing the significance of Gödel's work in the light of Wittgenstein's criticisms.

This paper critically engages Philip Mirowki's essay, "The scientific dimensions of social knowledge and their distant echoes in 20th-century American philosophy of science." It argues that although the cold war context of anti-democratic elitism best suited for making decisions about engaging in nuclear war may seem to be politically and ideologically motivated, in fact we need to carefully consider the arguments underlying the new rational choice based political philosophies of the post-WWII era typified by Arrow's impossibility theorem. A distrust (...) of democratic decision-making principles may be developed by social scientists whose leanings may be toward the left or right side of the spectrum of political practices. (shrink)

In 1931 the mathematical logician Kurt Godel published a revolutionary paper that challenged certain basic assumptions underpinning mathematics and logic. A colleague of Albert Einstein, his theorem proved that mathematics was partly based on propositions not provable within the mathematical system and had radical implications that have echoed throughout many fields. A gripping combination of science and accessibility, Godel’s Proof by Nagel and Newman is for both mathematicians and the idly curious, offering those with a taste for logic and (...) philosophy the chance to satisfy their intellectual curiosity. (shrink)

Arrow’s axiomatic foundation of social choice theory can be understood as an application of Tarski’s methodology of the deductive sciences—which is closely related to the latter’s foundational contribution to model theory. In this note we show in a model-theoretic framework how Arrow’s use of von Neumann and Morgenstern’s concept of winning coalitions allows to exploit the algebraic structures involved in preference aggregation; this approach entails an alternative indirect ultrafilter proof for Arrow’s dictatorship result. This link also connects Arrow’s seminal result (...) to key developments and concepts in the history of model theory, notably ultraproducts and preservation results. (shrink)

A new approach to quantum theory is proposed in this paper. The basis is taken to be theoretical variables, variables that may be accessible or inaccessible, i.e., it may be possible or impossible for an observer to assign arbitrarily sharp numerical values to them. In an epistemic process, the accessible variables are just ideal observations connected to an observer or to some communicating observers. Group actions are defined on these variables, and group representation theory is the basis for developing the (...) Hilbert space formalism here. Operators corresponding to accessible theoretical variables are derived, and in the discrete case, it is proved that the possible physical values are the eigenvalues of these operators. The focus of the paper is some mathematical theorems paving the ground for the proposed foundation of quantum theory. It is shown here that the groups and transformations needed in this approach can be constructed explicitly in the case where the accessible variables are finite-dimensional. This simplifies the theory considerably: To reproduce the Hilbert space formulation, it is enough to assume the existence of two complementary variables. The interpretation inferred from the proposed foundation here may be called a general epistemic interpretation of quantum theory. A special case of this interpretation is QBism; it also has a relationship to several other interpretations. (shrink)

Halin in 1965 proved that if a graph has [Formula: see text] many pairwise disjoint rays for each [Formula: see text] then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic complexity. The statement of Halin’s theorem and the construction proving it seem very much like standard versions of compactness arguments such as König’s Lemma. Those results, while not computable, are relatively simple. They only (...) use arithmetic procedures or, equivalently, finitely many iterations of the Turing jump. We show that several Halin-type theorems are much more complicated. They are among the theorems of hyperarithmetic analysis. Such theorems imply the ability to iterate the Turing jump along any computable well ordering. Several important logical principles in this class have been extensively studied beginning with work of Kreisel, H. Friedman, Steel and others in the 1960s and 1970s. Until now, only one purely mathematical example was known. Our work provides many more and so answers Question 30 of Montalbán’s Open Questions in Reverse Mathematics in 2011. Some of these theorems including ones in Halin in 1965 are also shown to have unusual proof theoretic strength as well. (shrink)

Northern Ireland physicist John Stewart Bell's possible understanding of quantum theory.

This short book has two main purposes. The first is to explain Kurt Gödel's first and second incompleteness theorems in informal terms accessible to a layperson, or at least a non-logician. The author claims that, to follow this part of the book, a reader need only be familiar with the mathematics taught in secondary school. I am not sure if this is sufficient. A grasp of the incompleteness theorems, even at the level of ‘the big picture’, might require some experience (...) with the rigor of mathematical proof. Moreover, since the incompleteness theorems concern formal deductive systems, it would help for a potential reader of this book to have some familiarity with at least elementary logic.There are, of course, a number of informal expositions of the incompleteness theorems. I do not see the need to engage in a comparative study. The second, and more important, goal of the present book is to discuss some alleged consequences of the incompleteness theorems and, in particular, to debunk thoroughly claims in philosophy, religion, and literary criticism that are supposed to be established, or at least bolstered, by incompleteness. The execution of this part of the book is masterly. The arguments are clear and compelling.The book has eight chapters, each between eight and twenty-eight pages. The opening chapter gives a very brief account of the incompleteness theorems and a sketch of Gödel's life and work. Chapter 2 gives the main overview of the incompleteness theorems, plus …. (shrink)

The main theorem of this paper is: If ƒ is a partial function from ℵ 1 to ℵ 1 which is ∑ 1 1 -bounded, then there is a weakly finite primitive recursive dilator D such that for all infinite αϵdom , ƒ ⩽ D . The proof involves only elementary combinatorial constructions of trees. A generalization to ptykes is also given.

A set S of degrees is said to be an initial segment if c ≤ d ∈ S→-c∈S. Shoenfield has shown that if P is the lattice of all subsets of a finite set then there is an initial segment of degrees isomorphic to P. Rosenstein [2] (independently) proved the same to hold of the lattice of all finite subsets of a countable set. We shall show that “countable set” may be replaced by “set of cardinality at most that of (...) the continuum.” This result is also an extension of [3, Corollary 2 to Theorem 15], which states that there is a sublattice of degrees isomorphic to the lattice of all finite subsets of 2N. (A sublattice of degrees is a subset closed under ∪ and ∩; an initial segment closed under ∪ is necessarily a sublattice, but not conversely.)It seems worth noting that the proof of the present result was preceded in time by our proof [4] of the analogous theorem for hyperdegrees, and is in fact an adaptation of that proof. Thus the present work has been influenced much more directly by the Gandy-Sacks forcing construction of a minimal hyperdegree [1] than by previous work on initial segments of degrees. (shrink)

This is a critical analysis of the first part of Go¨del’s 1951 Gibbs lecture on certain philosophical consequences of the incompleteness theorems. Go¨del’s discussion is framed in terms of a distinction between objective mathematics and subjective mathematics, according to which the former consists of the truths of mathematics in an absolute sense, and the latter consists of all humanly demonstrable truths. The question is whether these coincide; if they do, no formal axiomatic system (or Turing machine) can comprehend the mathematizing (...) potentialities of human thought, and, if not, there are absolutely unsolvable mathematical problems of diophantine form. (shrink)

In a fluent, clear, and lively style this translation by two of Maslov's junior colleagues brings the work of the late Soviet scientist S. Yu. Maslov to a wider audience. Maslov was considered by his peers to be a man of genius who was making fundamental contributions in the fields of automatic theorem proving and computational logic. He published little, and those few papers were regarded as notoriously difficult. This book, however, was written for a broad audience of readers (...) and describes elegant examples of applications in such fields as computer science, artificial intelligence, operations research, economic modeling, and biological modeling, among others. The book also brings to light the work by the American mathematician E. L. Post, which inspired Maslov's own work in the development of a general theory and which has been long neglected by mathematicial logicians and systems theorists in the United States. The book's first chapter introduces the Rules of the Game. Part I, Mathematics of Calculi, covers E. L. Post's canonical systems, deductive systems and algorithms, and probabilistic calculi and deductive information. Part II, Horizonal Modeling, takes up a "toy" economy, the calculi of technological possibilities, and the development of rules. Part III, Vertical Modeling, deals with the topics of "to fight and to search" and the consequences of the asymmetry of cognitive mechanisms. Vladimir Lifschitz is affiliated with the Department of Computer Science at Stanford University, and Michael Gelfond with the Department of Electrical Engineering and Computer Science at the University of Texas, El Paso. Theory of Deductive Systems and Its Applicationsis included in the Foundation of Computing Series, edited by Michael Garey. (shrink)

This book discusses how rational choice theory grew out of RAND's work for the US Air Force. It concentrates on the work of William J. Riker, Kenneth J. Arrow, James M. Buchanan, Russel Hardin, and John Rawls. It argues that within the context of the US Cold War with its intensive anti-communist and anti-collectivist sentiment, the foundations of capitalist democracy were grounded in the hyper individualist theory of non-cooperative games.

By indirect-deduction theorems introduced in the present paper we mean the theorems that allow to formalize indirect reasonings occurring in deductive practice in general and in mathematics in particular. We discuss the relationship between the introduced theorems and some logical calculi being virtually confined to propositional calculi with implication and negation. It is worth to notice that the above theorems are very handy and effective in proving logical theses.

Charles Chihara's new book develops and defends a structural view of the nature of mathematics, and uses it to explain a number of striking features of mathematics that have puzzled philosophers for centuries. The view is used to show that, in order to understand how mathematical systems are applied in science and everyday life, it is not necessary to assume that its theorems either presuppose mathematical objects or are even true. Chihara builds upon his previous work, in which he presented (...) a new system of mathematics, the constructibility theory, which did not make reference to, or presuppose, mathematical objects. Now he develops the project further by analysing mathematical systems currently used by scientists to show how such systems are compatible with this nominalistic outlook. He advances several new ways of undermining the heavily discussed indispensability argument for the existence of mathematical objects made famous by Willard Quine and Hilary Putnam. And Chihara presents a rationale for the nominalistic outlook that is quite different from those generally put forward, which he maintains have led to serious misunderstandings.A Structural Account of Mathematics will be required reading for anyone working in this field. (shrink)

It is demonstrated that a non Abelian Stokes Theorem is necessary to describe the B3 field of radiation. A simple form of the theorem is build up from the fundamental definition of B3 in O(3) gauge field theory, which is a gauge field theory applied to electrodynamics with an O(3) internal gauge symmetry bases on a complex basis ((1), (2), (3)). The indices (1) and (2) are complex conjugate pairs based on circular polarization, and the index (3) is (...) aligned with the propagation axis of radiation. (shrink)

The aim of this paper is to distinguish between, and examine, three issues surrounding Humphreys's paradox and interpretation of conditional propensities. The first issue involves the controversy over the interpretation of inverse conditional propensities — conditional propensities in which the conditioned event occurs before the conditioning event. The second issue is the consistency of the dispositional nature of the propensity interpretation and the inversion theorems of the probability calculus, where an inversion theorem is any theorem of probability that (...) makes explicit (or implicit) appeal to a conditional probability and its corresponding inverse conditional probability. The third issue concerns the relationship between the notion of stochastic independence which is supported by the propensity interpretation, and various notions of causal independence. In examining each of these issues, it is argued that the dispositional character of the propensity interpretation provides a consistent and useful interpretation of the probability calculus. (shrink)