Cut-free tableau calculi for some propositional normal modal logics

We give sound and complete tableau and sequent calculi for the prepositional normal modal logics S4.04, K4B and G ⁰(these logics are the smallest normal modal logics containing K and the schemata A A, A A and A ( A); A A and AA; A A and ((A A) A) A resp.) with the following properties: the calculi for S4.04 and G ⁰are cut-free and have the interpolation property, the calculus for K4B contains a restricted version of the cut-rule, the so-called analytical cut-rule.In addition we show that G ⁰is not compact (and therefore not canonical), and we proof with the tableau-method that G ⁰is characterised by the class of all finite, (transitive) trees of degenerate or simple clusters of worlds; therefore G ⁰is decidable and also characterised by the class of all frames for G ⁰.Research supported by Fonds zur Förderung der wissenschaftlichen Forschung, project number P8495-PHY.Presented by W. Rautenberg     

The liar: What paradox?

Most philosophers believe that the Liar Paradox is semantical in character, and arises from difficulties in the predicate true. The author argues that the paradox is pragmatic, not semantic, and arises from violations of essential conditions that define statement-making speech acts. The author shows that his solution to the paradox will not only handle the classical Liar sentences that are necessarily or intrinsically paradoxical, but also sets of Kripke-sentences that are contingently paradoxical.     

Supererogation in Deontic Logic: Metatheory for DWE and Some Close Neighbours

In "Doing Well Enough: Toward a Logic for Common Sense Morality", Paul McNamara sets out a semantics for a deontic logic which contains the operator It is supererogatory that. As well as having a binary accessibility relation on worlds, that semantics contains a relative ordering relation, . For worlds u, v and w, we say that u w v when v is at least as good as u according to the standards of w. In this paper we axiomatize logics complete over three versions of the semantics. We call the strongest of these logics DWE for Doing Well Enough.     

Modal logic with names

We investigate an enrichment of the propositional modal language with a universal modality having semanticsx iff y(y ), and a countable set of names — a special kind of propositional variables ranging over singleton sets of worlds. The obtained language _c proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment () of, where is an additional modality with the semanticsx iff y(y x y ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in _c. Strong completeness of the normal _c-logics is proved with respect to models in which all worlds are named. Every _c-logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from to _c are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched.     

An extension of the partial credit model with an application to the measurement of change

The partial credit model is considered under the assumption of a certain linear decomposition of the item × category parameters _ih into basic parameters _j. This model is referred to as the linear partial credit model. A conditional maximum likelihood algorithm for estimation of the j is presented, based on (a) recurrences for the combinatorial functions involved, and (b) using a quasi-Newton approach, the so-called Broyden-Fletcher-Goldfarb-Shanno (BFGS) method; (a) guarantees numerically stable results, (b) avoids the direct computation of the Hesse matrix, yet produces a sequence of certain positive definite matricesB _k ,k=1, 2, ..., converging to the asymptotic variance-covariance matrix of the . The practicality of these numerical methods is demonstrated both by means of simulations and of an empirical application to the measurement of treatment effects in patients with psychosomatic disorders.The authors thank one anonymous reviewer for his constructive comments. Moreover, they thankfully acknowledge financial support by the Österreichische Nationalbank (Austrian National Bank) under Grant No. 3720.     

Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs?

The main result of this paper belongs to the field of the comparative study of program verification methods as well as to the field called nonstandard logics of programs. We compare the program verifying powers of various well-known temporal logics of programs, one of which is the Intermittent Assertions Method, denoted as Bur. Bur is based on one of the simplest modal logics called S5 or sometime-logic. We will see that the minor change in this background modal logic increases the program verifying power of Bur. The change can be described either technically as replacing the reflexive version of S5 with an irreflexive version, or intuitively as using the modality some-other-time instead of sometime. Some insights into the nature of computational induction and its variants are also obtained.This project was supported by the Hungarian National Foundation for Scientific Research, Grant No. 1810.     

Converse Ackermann Croperty and semiclassical negation

A prepositional logic S has the Converse Ackermann Property (CAP) if (AB)C is unprovable in S when C does not contain . In A Routley-Meyer semantics for Converse Ackermann Property (Journal of Philosophical Logic, 16 (1987), pp. 65–76) I showed how to derive positive logical systems with the CAP. There I conjectured that each of these positive systems were compatible with a so-called semiclassical negation. In the present paper I prove that this conjecture was right. Relational Routley-Meyer type semantics are provided for each one of the resulting systems (the positive systems plus the semiclassical negation).     

A Sound and Complete Tableau Calculus for Reasoning about only Knowing and Knowing at Most

We define a tableau calculus for the logic of only knowing and knowing at most ON, which is an extension of Levesque's logic of only knowing O. The method is based on the possible-world semantics of the logic ON, and can be considered as an extension of known tableau calculi for modal logic K45. From the technical viewpoint, the main features of such an extension are the explicit representation of "unreachable" worlds in the tableau, and an additional branch closure condition implementing the property that each world must be either reachable or unreachable. The calculus allows for establishing the computational complexity of reasoning about only knowing and knowing at most. Moreover, we prove that the method matches the worst-case complexity lower bound of the satisfiability problem for both ON and O. With respect to [22], in which the tableau calculus was originally presented, in this paper we both provide a formal proof of soundness and completeness of the calculus, and prove the complexity results for the logic ON.     

Before refraining: Concepts for agency

A structure is described that can serve as a foundation for a semantics for a modal agentive construction such as sees to it that Q ([ stit: Q]). The primitives are Tree,,Instant, Agent, choice. Eleven simple postulates governing this structure are set forth and motivated. Tree and encode a picture of branching time consisting of moments gathered into maximal chains called histories. Instant imposes a time-like ordering. Agent consists of agents, and choice assigns to each agent and each moment in Tree a set of possible choices, where each possible choice is a set of histories. All of these ingredients are referred to in the semantics suggested for [ stit: Q]. The most complex part of the discussion is the motivation for the definition of what it means for a typically non-terminating chain of moments jointly to witness the truth of [ stit: Q] at a moment.The paper begins with an informal account of the Refref conjecture, which says that the only way to refrain from refraining from seeing to something is to see to it. The paper ends with a consideration of an argument of Prior's that in a certain sense contemplation and action are inconsistent.     

Possible worlds semantics: A research program that cannot fail?

Providing a possible worlds semantics for a logic involves choosing a class of possible worlds models, and setting up a truth definition connecting formulas of the logic with statements about these models. This scheme is so flexible that a danger arises: perhaps, any (reasonable) logic whatsoever can be modelled in this way. Thus, the enterprise would lose its essential tension. Fortunately, it may be shown that the so-called incompleteness-examples from modal logic resist possible worlds modelling, even in the above wider sense. More systematically, we investigate the interplay of truth definitions and model conditions, proving a preservation theorem characterizing those types of truth definition which generate the minimal modal logic.     

Parallel action: Concurrent dynamic logic with independent modalities

Regular dynamic logic is extended by the program construct, meaning and executed in parallel. In a semantics due to Peleg, each command is interpreted as a set of pairs (s,T), withT being the set of states reachable froms by a single execution of, possibly involving several processes acting in parallel. The modalities << and [] are given the interpretations<>A is true ats iff there existsT withsRT andA true throughoutT, and[]A is true ats iff for allT, ifsRT thenA is true throughoutT, which make <> and [] no longer interdefinable via negation, as they are in the regular case.We prove that the logic defined by this modelling is finitely axiomatisable and has the finite model property, hence is decidable. This requires the development a new theory of canonical models and filtrations for reachability relations.     

Can Deflationists be Dialetheists?

Philosophical work on truth covers two streams of inquiry, one concerning the nature (if any) of truth, the other concerning truth-related paradox, especially the Liar. For the most part these streams have proceeded fairly independently of each other. In his Deflationary Truth and the Liar (JPL 28:455–488, 1999) Keith Simmons argues that the two streams bear on one another in an important way; specifically, the Liar poses a greater problem for deflationary conceptions of truth than it does for inflationist conceptions. We agree with Simmons on this point; however, we disagree with his main conclusion. In a nutshell, Simmons' main conclusion is that deflationists can solve the Liar only by compromising deflationism. If Simmons is right, then deflationists cannot solve the Liar paradox. In this paper we argue that, pace Simmons, there is an approach to the Liar that is available to deflationists, namely dialetheism.     

A Revenge-Immune Solution to the Semantic Paradoxes

The paper offers a solution to the semantic paradoxes, one in which (1) we keep the unrestricted truth schema True(A)A, and (2) the object language can include its own metalanguage. Because of the first feature, classical logic must be restricted, but full classical reasoning applies in ordinary contexts, including standard set theory. The more general logic that replaces classical logic includes a principle of substitutivity of equivalents, which with the truth schema leads to the general intersubstitutivity of True(A) with A within the language.The logic is also shown to have the resources required to represent the way in which sentences (like the Liar sentence and the Curry sentence) that lead to paradox in classical logic are defective. We can in fact define a hierarchy of defectiveness predicates within the language. Contrary to claims that any solution to the paradoxes just breeds further paradoxes (revenge problems) involving defectiveness predicates, there is a general consistency/conservativeness proof that shows that talk of truth and the various levels of defectiveness can all be made coherent together within a single object language.     

The American plan completed: Alternative classical-style semantics,without stars,for relevant and paraconsistent logics

American-plan semantics with 4 values 1, 0, { {1, 0}} {{}}, interpretable as True, False, Both and Neither, are furnished for a range of logics, including relevant affixing systems. The evaluation rules for extensional connectives take a classical form: in particular, those for negation assume the form 1 (A, a) iff 0 (A, a) and 0 (A, a) iff 1 (A, a), so eliminating the star function *, on which much criticism of relevant logic semantics has focussed. The cost of these classical features is a further relation (or operation), required in evaluating falsity assignments of implication formulae.Two styles of 4 valued relational semantics are developed; firstly a semantics using notions of double truth and double validity for basic relevant systemB and some extensions of it; and secondly, since the first semantics makes heavy weather of validating negation principles such as Contraposition, a reduced semantics using more complex implicational rules for relevant systemC and various of its extensions. To deal satisfactorily with elite systemsR,E andT, however, further complication is inevitable; and a relation of mateship (suggested by the Australian plan) is introduced to permit cross-over from 1 to 0 values and vice versa.     

Логистическая система, исходными связками которой являются эквивалентность и дизъюнкция

- Allatum est die 5 Martii 1970     

A New Representation Theorem for Contranegative Deontic Logic

The logic of an ought operator O is contranegative with respect to an underlying preference relation if it satisfies the property Op & (¬p)(¬q) Oq. Here the condition that is interpolative ((p (pq) q) (q (pq) p)) is shown to be necessary and sufficient for all -contranegative preference relations to satisfy the plausible deontic postulates agglomeration (Op & OqO(p&q)) and disjunctive division (O(p&q) Op Oq).     

On a certain class ofm-address machines

Conclusion It follows from the proved theorems that ifM =Q, (whereQ={0,q ₁,q ₂,...,q }) is a machine of the classM _F then there exist machinesM _i such thatM _i(1,c)=M (q _i,c) andQ _i={0, 1, 2, ..., +1} (i=1, 2, ..., ).And thus, if the way in which to an initial function of content of memorycC a machine assigns a final onecC is regarded as the only essential property of the machine then we can deal with the machines of the formM ={0, 1, 2, ..., }, and processes (t) (wheret=1,c,cC) only.Such approach can simplify the problem of defining particular machines of the classM _F , composing and simplifying them.Allatum est die 19 Januarii 1970     

Embeddability,syntax, and semantics in accounts of scientific theories

Recently several philosophers of science have proposed what has come to be known as the semantic account of scientific theories. It is presented as an improvement on the positivist account, which is now called the syntactic account of scientific theories. Bas van Fraassen claims that the syntactic account does not give a satisfactory definition of empirical adequacy and empirical equivalence. He contends that his own semantic account does define these notations acceptably, through the concept of embeddability, a concept which he claims cannot be defined syntactically. Here, I define a syntactic relation which corresponds to the semantic relation of embeddability. I suggest that the critical differences between the positivist account and van Fraassen's account have nothing to do with the distinction between semantics and syntax.     

O pojęciu zdania analitycznego

Rezultaty przedstawione w pracy niniejszej pokrywaj si czciowo z wynikami osignitymi przezR. Wójcickiego w pracy:Analityczne komponenty definicji arbitralnych. Studia Logica, t. XIV. Dotyczy to gównie rezultatów zawartych w czci pierwszej. Chciabym podkreli, i wyniki R. Wójcickiego uzyskane zostay cakowicie niezalenie od rezultatów przedstawionych w pracy obecnej.Allatum est die 16 Aprilis 1962