Logics

A variable binding term operator is an operator which binds variables of formulas to give origin to terms. Examples of vbtos are the description operator ι, Hilbert’s ε-symbol, the classifier { : }, and Russell’s abstraction operator ˆx1xˆ2 . . . xˆnF. It is usual to introduce vbtos by contextual definition, though their treatment in first- and higherorder languages as new primitive symbols, added to them, is more convenient, especially from the semantic point of view. A semantic approach to vbtos (...) in classical logic is contained in da Costa 1980 . In this note we outline how vbtos can be handled in some paraconsistent and paracomplete logics, precisely those logics of da Costa 1974 and da Costa and Marconi 1986. But our methods apply equally will to several other non-classical systems. Although in some particular cases, for instance in the case of the description operator in certain first-order languages, the contextual treatment of vbtos seems to be reasonable, we limit ourselves here to the semantic approach to these operators. In order to develop our semantic analysis, we combine the methods of da Costa 1980 with those of Alves 1984; in this last paper, a paraconsistent model theory is studied relative to da Costa’s predicate calculi with equality C = n , 1 ≤ n ≤ ω. (shrink)

We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of non-deductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix with entries in {0,1}, we allow for one or more blank squares in the matrix, say $a_{i,j} =?.$ The method allows us to decide whether to declare $a_{i,j} = 0$ or $a_{i,j} = 1$ or $a_{i,j} =?$ undecided. This algorithmic method is then applied (...) to modelling several legal and practical reasoning situations including the Talmudic rule of Kal-Vachomer. We add an Appendix showing that this new rule of Matrix Abduction, arising from the Talmud, can also be applied to the analysis of paradoxes in voting and judgement aggregation. In fact we have here a general method for executing non-deductive inferences. (shrink)

A forcing poset of size 221 which adds no new reals is described and shown to provide a Δ22 definable well-order of the reals . The encoding of this well-order is obtained by playing with products of Aronszajn trees: some products are special while other are Suslin trees. The paper also deals with the Magidor–Malitz logic: it is consistent that this logic is highly noncompact.

Abramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 1–77. The mathematical framework of Stone duality is used to synthesise a number of hitherto separate developments in theoretical computer science.• Domain theory, the mathematical theory of computation introduced by Scott as a foundation for detonational semantics• The theory of concurrency and systems behaviour developed by Milner, Hennesy based on operational semantics.• Logics of programsStone duality provides a junction between semantics and logics . Moreover, the underlying (...) logic is geometric, which can be computationally interpreted as the logic of observable properties—i.e., properties which can be determined to hold of a process on the basis of a finite amount of information about its execution.These ideas lead to the following programme. A metalanguage is introduced, comprising• types = universes of discourse for various computational situations;• terms = PROGRAMS = syntactic intensions for models or points. A standard denotational interpretation of the metalanguage is given, assigning domains to types and domain elements to terms. The metalanguage is also given a logical interpretation, in which types are interpreted as propositional theories and terms are interpreted via a program logic, which axiomatises the properties they satisfy. The two interpretations are related by showing that they are Stone duals of each other. Hence, semantics and logic are guaranteed to be in harmony with each other, and in fact each determines the other up to isomorphism. This opens the way to a whole range of applications. Given a denotational description of a computational situation in our metalanguage, we can turn the handle to obtain a logic for that situation. (shrink)

We study increasing F-sequences, where F is a dilator: an increasing F-sequence is a sequence (indexed by ordinal numbers) of ordinal numbers, starting with 0 and terminating at the first step x where F(x) is reached (at every step x + 1 we use the same process as in decreasing F-sequences, cf. [2], but with "+ 1" instead of "- 1"). By induction on dilators, we shall prove that every increasing F-sequence terminates and moreover we can determine for every dilator (...) F the point where the increasing F-sequence terminates. We apply these results to inverse Goodstein sequences, i.e. increasing (1 + Id) (ω) -sequences. We show that the theorem every inverse Goodstein sequence terminates (a combinatorial theorem about ordinal numbers) is not provable in ID 1 . For a general presentation of the results stated in this paper, see [1]. We use notions and results concerning the category ON (ordinal numbers), dilators and bilators, summarized in [2, pp. 25-31]. (shrink)

ZusammenfassungDer Verfasser geht auf Beziehungen zwischen dem von C. I. Lewis eingeführten Begriff der « strikten » Implikation und dem von ihm selbst eingeführten Begriff der « strengen » Implikation ein. Er zeigt, dass sich innerhalb des Systems der strengen Implikation ein weiterer Folgebegriff definieren lässt, der alle Eigenschaften hat, die von der strikten Implikation verlangt werden. Als dieser Folgebegriff wird genommen, dass die Konjunktion von A und dem Gegenteil von B unmöglich ist, was in dem System der strengen Implikation (...) keineswegs damit identisch ist, dass A in strenger Weise B impliziert. Das System der strikten Implikation wird dabei in einer von Arnold Schmidt gegebenen Form zugrunde gelegt.RésuméIl s'agit des relations entre la conception d'implication stricte introduite par C. I. Lewis et la conception de « strenge » implication introduite par l'auteur. L'auteur indique qu'une conception d'implication se laisse définir dans le système de « strenge » implication qui a toutes les qualités d'implication stricte. La définition est la suivante: A implique B a ce sens si la conjonction de A et non B est impossible ce qui n'équivaut pas à la proposition qu'il y a de « strenge » implication de A à B. Le système d'implication stricte est considéré sous la forme qui lui a été donnée par Arnold Schmidt.In this paper the author enters into the particulars of the relations of the concept of « strict » implication introduced by C. I. Lewis with the concept of « strenge » implication introduced by himself. He points out that within the system of « strenge »implication a further concept of implication may be defined which has all the qualities of strictimplication. The definition is the following: A implies B in this sense if the conjunction of A and non‐B is impossible, which is not the same as the « strenge » implication between A and B. The system of strict implication is taken in the form as formerly given by Arnold Schmidt. (shrink)

Although the theory of definability had many important antecedents—such as the descriptive set theory initiated by the French semi-intuitionists in the early 1900s—the main ideas were first laid out in precise mathematical terms by Alfred Tarski beginning in 1929. We review here the basic notions of languages, explicit definability, and grammatical complexity, and emphasize common themes in the theories of definability for four important languages underlying, respectively, descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. We review (...) the history of previous studies of the similarities and differences in the theories of definability of the first three of these four languages. A seminal role leading toward unification of the theories has been played by the separation principles introduced by Nikolai Luzin in 1927. Emphasizing analogies and driving toward further unification embracing finite-universe logic we concentrate on a simple example—the first and second separation principles for existential-universal first-order sentences . Using this as a test case for the fundamental problem of how to “finitize” arguments in classical pure logic to the finite-universe case, we are led to the analogous negative solution by using the theory of certain special graphs: a graph is - special for any positive integers m , n , p , q iff it is bipartite with m red points and n blue points and for every p -tuple of red points there is a blue point to which they are all connected . As an aside we introduce for further study a natural “Ramseyesque” increasing sequence A of positive integers, where A is the least positive integer n for which an -special graph exists. (shrink)

Positivists identify science and certainty and in the name of the utter rationality of science deny that it rests on speculative presuppositions. The Logical Positivists took a step further and tried to show such presuppositions really no presuppositions at all but rather poorly worded sentences. Rules of sentence formation, however, rest on the presuppositions about the nature of language. This makes us unable to determine the status of mathematics, which is these days particularly irksome since this question is now-since Abraham (...) Robinson-one that mathematicians cannot ignore. Since mathematics is the paradigm of a logical discourse, logic must offer a system adequate enough to serve mathematics. This fact makes it difficult to avoid making question-begging moves in both mathematics and logic. We must therefore view the rationality of logic as partial and hope it is stepwise improvable. The theory of rationality thus turns to be the major presupposition of logic, and one which has ample metaphysical background to it. The very supposition, basic to all logic, that language is divisible into form andcontent is under suspicion-mathematics perhaps belongs to neither. (shrink)

Foreword DOI:10.5007/1808-1711.2011v15n2p223.

We propose strategic games wherein the strategies consist of players asking each other questions and answering those questions. We study simplifications of such games wherein two players simultaneously ask each other a question that the opponent is then obliged to answer. The motivation for our research is to model conversation including the dynamics of questions and answers, to provide new links between game theory and dynamic logics of information, and to exploit the dynamic/strategic structure that, we think, lies implicitly inside (...) epistemic models for epistemic languages, and to make that structure an explicit subject of logical study. Our main contributions are: the notion of a two-person question-answer game with information goals, the existence and computation of equilibria for these games, the correspondence with Bayesian games and their equilibria, and a connection between logic and game theory namely the existence of equilibria for positive goal formulae. (shrink)

We define a multi-modal version of Computation Tree Logic (CTL) by extending the language with path quantifiers $E^\delta $ and $E^\delta $ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a CTL axiomatisation for each dimension. Completeness is proved by employing the completeness result for CTL to obtain a model along each dimension in turn. We also show that (...) the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for CTL. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional CTL logic. (shrink)

We study the logic of strategic ability of coalitions of agents with bounded memory by introducing Alternating-time Temporal Logic with Bounded Memory (ATLBM), a variant of Alternating-time Temporal Logic (ATL). ATLBM accounts for two main consequences of the assumption that agents have bounded memory. First, an agent can only remember a strategy that specifies actions in a bounded number of different circumstances. While the ATL-formula means that coalition C has a joint strategy which will make φ true forever, the ATLBM-formula (...) means that C has a joint strategy which for each agent in C specifies what to do in no more than n different circumstances and which will make φ true forever. Second, an agent has bounded recall—a strategy can only take the last m states of the system into account. We use the logic to study the interaction between strategic ability, bounded number of decisions, bounded recall and incomplete information. We discuss the logical properties and expressiveness of ATLBM, and its relationship to ATL. We show that ATLBM can express properties of strategic ability under bounded memory which cannot be expressed in ATL. (shrink)

For each integer n≥0, we provide an explicit functional characterization of the free n-generated BL-algebra, together with an explicit construction of the corresponding normal forms.

We extend de Finetti’s No-Dutch-Book Criterion to Gödel infinite-valued propositional logic.

We extend de Finetti's No-Dutch-Book Criterion to Gödel infinite-valued propositional logic.

We solve some open questions on the amalgamation porperty in various algebras of logic . Some of these problems first appeared in Pigozzi [3].

Using games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEAα of representable quasi-polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka’s methods of splitting, to adapt the quasi-polyadic equality case, we show that if Σ is a set of equations axiomatizing RPEAn for equation image and equation imageequation image, k′ < ω are natural numbers, then Σ contains infinitely equations in which − occurs, one of (...) + or · occurs, a diagonal or a permutation with index l occurs, more than k cylindrifications and more than k′ variables occur. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)

We show that the modal µ-calculus over GL collapses to the modal fragment by showing that the fixpoint formula is reached after two iterations and answer to a question posed by van Benthem in [4]. Further, we introduce the modal µ~-calculus by allowing fixpoint constructors for any formula where the fixpoint variable appears guarded but not necessarily positive and show that this calculus over GL collapses to the modal fragment, too. The latter result allows us a new proof of the (...) de Jongh, Sambin Theorem and provides a simple algorithm to construct the fixpoint formula. (shrink)