The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on: admissible or permissible inference rules the derivability of the admissible inference rules the structural completeness of logics the bases for admissible and valid inference rules. There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered. The book is basically self-contained and special (...) attention has been made to present the material in a convenient manner for the reader. Proofs of results, many of which are not readily available elsewhere, are also included. The book is written at a level appropriate for first-year graduate students in mathematics or computer science. Although some knowledge of elementary logic and universal algebra are necessary, the first chapter includes all the results from universal algebra and logic that the reader needs. For graduate students in mathematics and computer science the book is an excellent textbook. (shrink)

An algorithm recognizing admissibility of inference rules in generalized form (rules of inference with parameters or metavariables) in the intuitionistic calculus H and, in particular, also in the usual form without parameters, is presented. This algorithm is obtained by means of special intuitionistic Kripke models, which are constructed for a given inference rule. Thus, in particular, the direct solution by intuitionistic techniques of Friedman's problem is found. As a corollary an algorithm for the recognition of the solvability of logical equations (...) in H and for constructing some solutions for solvable equations is obtained. A semantic criterion for admissibility in H is constructed. (shrink)

We study unification problem and problem of admissibility for inference rules in minimal Johanssonsʼ logic J and positive intuitionistic logic IPC+. This paper proves that the problem of admissibility for inference rules with coefficients is decidable for the paraconsistent minimal Johanssonsʼ logic J and the positive intuitionistic logic IPC+. Using obtained technique we show also that the unification problem for these logics is also decidable: we offer algorithms which compute complete sets of unifiers for any unifiable formula. Checking just unifiability (...) of formulas with coefficients also works via verification of admissibility. (shrink)

We find an explicit basis for all admissible rules of the modal logic S4. Our basis consists of an infinite sequence of rules which have compact and simple, readable form and depend on increasing set of variables. This gives a basis for all quasi-identities valid in the free modal algebra ℱS4 of countable rank.

We prove that a propositional Linear Temporal Logic with Until and Next has unitary unification. Moreover, for every unifiable in LTL formula A there is a most general projective unifier, corresponding to some projective formula B, such that A is derivable from B in LTL. On the other hand, it can be shown that not every open and unifiable in LTL formula is projective. We also present an algorithm for constructing a most general unifier.

Our investigation is concerned with the finite model property with respect to admissible rules. We establish general sufficient conditions for absence of fmp w. r. t. admissibility which are applicable to modal logics containing K4: Theorem 3.1 says that no logic λ containing K4 with the co-cover property and of width > 2 has fmp w. r. t. admissibility. Surprisingly many, if not to say all, important modal logics of width > 2 are within the scope of this theorem–K4 itself, (...) S4, GL, K4.1, K4.2, S4.1, S4.2, GL.2, etc. Thus the situation is completely opposite to the case of the ordinary fmp–the absolute majority of important logics have fmp, but not with respect to admissibility. As regards logics of width ≤ 2, there exists a zone for fmp w. r. t. admissibility. It is shown that all modal logics A of width ≤ 2 extending S4 which are not sub-logics of three special tabular logics have fmp w.r.t. admissibility. (shrink)

The paper aims at providing the multi-modal propositional logic LTK with a sound and complete axiomatisation. This logic combines temporal and epistemic operators and focuses on m odeling the behaviour of a set of agents operating in a system on the background of a temporal framework. Time is represented as linear and discrete, whereas knowledge is modeled as an S5-like modality. A further modal operator intended to represent environment knowledge is added to the system in order to achieve the expressive (...) power sufficient to describe the piece of information available to the agents at each moment in the flow of time. (shrink)

The main result of this paper is the following theorem: each modal logic extendingK4 having the branching property belowm and the effective m-drop point property is decidable with respect to admissibility. A similar result is obtained for intermediate intuitionistic logics with the branching property belowm and the strong effective m-drop point property. Thus, general algorithmic criteria which allow to recognize the admissibility of inference rules for modal and intermediate logics of the above kind are found. These criteria are applicable to (...) most modal logics for which decidability with respect to admissibility is known and to many others, for instance, to the modal logicsK4,K4.1,K4.2,K4.3,S4.1,S4.2,GL.2; to all smallest and greatest counterparts of intermediate Gabbay-De-Jong logicsD n; to all intermediate Gabbay-De-Jong logicsD n; to all finitely axiomatizable modal and intermediate logics of finite depth etc. Semantic criteria for recognizing admissibility for these logics are offered as well. (shrink)

This paper offers a brief analysis of the unification problem in modal transitive logics related to the logic S4 : S4 itself, K4, Grz and Gödel-Löb provability logic GL . As a result, new, but not the first, algorithms for the construction of ‘best’ unifiers in these logics are being proposed. The proposed algorithms are based on our earlier approach to solve in an algorithmic way the admissibility problem of inference rules for S4 and Grz . The first algorithms for (...) the construction of ‘best’ unifiers in the above mentioned logics have been given by S. Ghilardi in [ 16 ]. Both the algorithms in [ 16 ] and ours are not much computationally efficient. They have, however, an obvious significant theoretical value a portion of which seems to be the fact that they stem from two different methodological approaches. (shrink)

Our paper aims to investigate inference rules for Nelson’s logics and to discuss possible ways to determine admissibility of inference rules in such logics. We will use the technique offered originally for intuitionistic logic and paraconsistent minimal Johannson’s logic. However, the adaptation is not an easy and evident task since Nelson’s logics do not enjoy replacement of equivalences rule. Therefore we consider and compare standard admissibility and weak admissibility. Our paper founds algorithms for recognizing weak admissibility and admissibility itself – (...) for restricted cases, to show the problems arising in the course of study. (shrink)

We study the problem of finding a basis for all rules admissible in the intuitionistic propositional logic IPC. The main result is Theorem 3.1 which gives a basis consisting of all rules in semi-reduced form satisfying certain specific additional requirements. Using developed technique we also find a basis for rules admissible in the logic of excluded middle law KC.

The aim of this paper is to look from the point of view of admissibility of inference rules at intermediate logics having the finite model property which extend Heyting's intuitionistic propositional logic H. A semantic description for logics with the finite model property preserving all admissible inference rules for H is given. It is shown that there are continuously many logics of this kind. Three special tabular intermediate logics λ, 1 ≥ i ≥ 3, are given which describe all tabular (...) logics preserving admissibility: a tabular logic λ preserves all admissible rules for H iff 7λ has width not more than 2 and is not included in each λ. MSC: 03B55, 03B20. (shrink)

The paper studies Barwise's information frames and answers the John Barwise question: to find axiomatizations for the modal logics generated by information frames. We find axiomatic systems for (i) the modal logic of all complete information frames, (ii) the logic of all sound and complete information frames, (iii) the logic of all hereditary and complete information frames, (iv) the logic of all complete, sound and hereditary information frames, and (v) the logic of all consistent and complete information frames. The notion (...) of weak modal logics is also proposed, and it is shown that the weak modal logics generated by all information frames and by all hereditary information frames are K and K4 respectively. To develop general theory, we prove that (i) any Kripke complete modal logic is the modal logic of a certain class of information frames and that (ii) the modal logic generated by any given class of complete, rarefied and fully classified information frames is Kripke complete. This paper is dedicated to the memory of talented mathematician John Barwise. (shrink)

The paper deals with a temporal multi-agent logic TMAZ, which imitates taking of decisions based on agents' access to knowledge by their interaction. The interaction is modelled by possible communication channels between agents in special temporal Kripke/hintikka-like models. The logic TMAZ distinguishes local and global decisions-making. TMAZ is based on temporal Kripke/hintikka models with agents' accessibility relations defined on states of all possible time clusters C(i) (where indexes i range over all integer numbers Z). The main result provides a decision (...) algorithm for TMAZ (so, we prove that TMAZ is decidable). This algorithm also solves the satisfiability problem. In the final part of the paper, we consider the admissibility problem for inference rules in TMAZ, and show that this problem is decidable for TMAZ as well. (shrink)

In terms of formal deductive systems and multi-dimensional Kripke frames we study logical operations know, informed, common knowledge and common information. Based on [6] we introduce formal axiomatic systems for common information logics and prove that these systems are sound and complete. Analyzing the common information operation we show that it can be understood as greatest open fixed points for knowledge formulas. Using obtained results we explore monotonicity, omniscience problem, and inward monotonocity, describe their connections and give dividing examples. Also (...) we find algorithms recognizing these properties for some particular cases. (shrink)

In this paper1 we study admissible consecutions in multi-modal logics with the universal modality. We consider extensions of multi-modal logic S4n augmented with the universal modality. Admissible consecutions form the largest class of rules, under which a logic is closed. We propose an approach based on the context effective finite model property. Theorem 7, the main result of the paper, gives sufficient conditions for decidability of admissible consecutions in our logics. This theorem also provides an explicit algorithm for recognizing such (...) consecutions. Some applications to particular logics with the universal modality are given. (shrink)

We investigate logical consequence in temporal logics in terms of logical consecutions. i.e., inference rules. First, we discuss the question: what does it mean for a logical consecution to be 'correct' in a propositional logic. We consider both valid and admissible consecutions in linear temporal logics and discuss the distinction between these two notions. The linear temporal logic LDTL, consisting of all formulas valid in the frame 〈L, ≤, ≥〉 of all integer numbers, is the prime object of our investigation. (...) We describe consecutions admissible LDTL in a semantic way—via consecutions valid in special temporal Kripke/Hintikka models. Then we state that any temporal inference rule has a reduced normal form which is given in terms of uniform formulas of temporal degree 1. Using these facts and enhanced semantic techniques we construct an algorithm, which recognizes consecutions admissible in LDTL. Also, we note that using the same technique it follows that the linear temporal logic L (N) of all natural numbers is also decidable w.r.t. inference rules. So, we prove that both logics LDTL and L (N) are decidable w.r.t. admissible consecutions. In particular, as a consequence, they both are decidable (Known fact), and the given deciding algorithms are explicit. (shrink)

The subject of this study is the participants in artificial sociality (humans and artificial intelligence (AI) tools) and communication between them. The first section analyses (using Luhmann’s methodology) communication as the basis of sociality. The second section shows how AI tools became social technologies in the framework of artificial sociality. The third section describes experimental communication between authors and AI tools (the case of ChatGPT). For the first time in the Baltic countries, the authors examined sociological, humanitarian, natural and technological (...) aspects of the functioning AI tools, which participate in creation of a new social reality for human society – artificial sociality. (shrink)

Recently, psychologists have explored moral concepts including obligation, blame, and ability. While little empirical work has studied the relationships among these concepts, philosophers have widely assumed such a relationship in the principle that “ought” implies “can,” which states that if someone ought to do something, then they must be able to do it. The cognitive underpinnings of these concepts are tested in the three experiments reported here. In Experiment 1, most participants judge that an agent ought to keep a promise (...) that he is unable to keep, but only when he is to blame for the inability. Experiment 2 shows that such “ought” judgments correlate with judgments of blame, rather than with judgments of the agent’s ability. Experiment 3 replicates these findings for moral “ought” judgments and finds that they do not hold for nonmoral “ought” judgments, such as what someone ought to do to fulfill their desires. These results together show that folk moral judgments do not conform to a widely assumed philosophical principle that “ought” implies “can.” Instead, judgments of blame play a modulatory role in some judgments of obligation. (shrink)

This article defends the view that liars need not intend to deceive. I present common objections to this view in detail and then propose a case of a liar who can lie but who cannot deceive in any relevant sense. I then modify this case to get a situation in which this person lies intending to tell his hearer the truth and he does this by way of getting the hearer to recognize his intention to tell the truth by lying. (...) This case, and further cases that I develop from it, demonstrate that lying without the intention to deceive is possible. (shrink)

We prove that if I is a partially ordered set in a countable transitive model M of ZFC then M can be extended by a generic sequence of reals a i , i ∈ I, such that ℵ M 1 is preserved and every a i is Sacks generic over $\mathfrak{M}[\langle \mathbf{a}_j: j . The structure of the degrees of M-constructibility of reals in the extension is investigated. As applications of the methods involved, we define a cardinal invariant to distinguish (...) product and iterated Sacks extensions, and give a short proof of a theorem (by Budinas) that in ω 2 -iterated Sacks extension of L the Burgess selection principle for analytic equivalence relations holds. (shrink)

We conducted two experiments to determine whether common folk think that so-called _tell-tale sign_ bald-faced lies are intended to deceive—since they have not been tested before. These lies involve tell-tale signs (e.g. blushing) that show that the speaker is lying. Our study was designed to avoid problems earlier studies raise (these studies focus on a kind of bald-faced lie in which supposedly everyone knows that what the speaker says is false). Our main hypothesis was that the participants will think that (...) the protagonists from our examples lied without intending to deceive, and the results of our surveys confirmed this hypothesis: most of our participants rated tell-tale sign lies as lies not intended to deceive. Therefore, our analysis suggests that common folk think that some lies are not intended to deceive. (shrink)

This paper refines the received analysis of deceptive lies. This is done by assessing some cases of lies that are supposedly not intended to deceive and by arguing that they actually involve sophisticated strategies of intentional deception. These lies, that is, merely seem not to be intended to deceive and this is because our received analysis of deceptive lies is insufficiently sophisticated. We need to add these strategies to our analysis of deceptive lying. The argument ends by presenting this refined (...) analysis. (shrink)

ABSTRACTThe psychological and philosophical literature exploring the role of social influence in moral judgments suggests that conformity in moral judgments is common and, in many cases, seems to b...

In their paper published in 2017 in Philosophical Psychology, Ronja Rutschmann and Alex Wiegmann introduce a novel kind of lies, the indifferent lies. According to them, these lies are not intended to deceive simply because the liars do not care whether their audience is going to believe them or not. It seems as if indifferent lies avoid the objections raised against other kinds of lies supposedly not intended to deceive. I argue that this is not correct. Indifferent lies, too, are (...) either intended to deceive or are not lies at all, since they do not involve genuine assertions. (shrink)

A satisfactory analysis of human deception must rule out cases where it is a mistake or an accident that person B was misled by person A's behavior. Therefore, most scholars think that deceivers must intend to deceive. This article argues that there is a better solution: rather than appealing to the deceiver's intentions, we should appeal to the function of their behavior. After all, animals and plants engage in deception, and most of them are not capable of forming intentions. Accordingly, (...) certain human behavior is deceptive if and only if its function is to mislead. This solves our problem because if the function of A's behavior was to mislead, B's ending up misled was not an accident or a mere mistake even if A did not intend to deceive B. (shrink)

In his 2018 AJP paper, Shlomo Cohen hints that deception could be a distinct subset of manipulation. We pursue this thought further, but by arguing that Cohen’s accounts of deception and manipulation are incorrect. Deception under uncertainty need not involve adding false premises to the victim’s reasoning but it must involve manipulating her response, and cases of manipulation that do not interfere with the victim’s reasoning, but rather utilize it, also exist. Therefore, deception under uncertainty must be constituted by covert (...) manipulation. (shrink)

This paper examines the connection between lies, deception, and self-deception. Understanding this connection is important because the consensus is that you cannot deceive yourself by lying since you cannot make yourself believe as true a proposition you already believe is false – and, as a liar, you must assert a proposition you believe is false. My solution involves refining our analysis of lying: people can lie by asserting what they confidently believe is true. Thus, self-deceivers need not replace one belief (...) with another; rather, they may just increase existing credence in a proposition they already believe is true. (shrink)

We prove that in the Solovay model, every OD equivalence relation, E, over the reals, either admits an OD reduction to the equality relation on the set of all countable (of length $ ) binary sequences, or continuously embeds E 0 , the Vitali equivalence. If E is a Σ 1 1 (resp. Σ 1 2 ) relation then the reduction above can be chosen in the class of all ▵ 1 (resp. ▵ 2 ) functions. The proofs are based (...) on a topology generated by OD sets. (shrink)

In this article we show how the universe of BST, bounded set theory can be enlarged by definable subclasses of sets so that Separation and Replacement are true in the enlargement for all formulas, including those in which the standardness predicate may occur. Thus BST is strong enough to incorporate external sets in the internal universe in a way sufficient to develop topics in nonstandard analysis inaccessible in the framework of a purely internal approach, such as Loeb measures.

In this paper, the predicate counterparts, defined both axiomatically and semantically by means of Kripke frames, of the modal propositional logics $\textbf {GL}$, $\textbf {Grz}$, $\textbf {wGrz}$ and their extensions are considered. It is proved that the set of semantical consequences on Kripke frames of every logic between $\textbf {QwGrz}$ and $\textbf {QGL.3}$ or between $\textbf {QwGrz}$ and $\textbf {QGrz.3}$ is $\Pi ^1_1$-hard even in languages with three (sometimes, two) individual variables, two (sometimes, one) unary predicate letters, and a single (...) proposition letter. As a corollary, it is proved that infinite families of modal predicate axiomatic systems, based on the classical first-order logic and the modal propositional logics $\textbf {GL}$, $\textbf {Grz}$, $\textbf {wGrz}$ are not Kripke complete. Both $\Pi ^1_1$-hardness and Kripke incompleteness results of the paper do not depend on whether the logics contain the Barcan formula. (shrink)

People are remarkably smart: They use language, possess complex motor skills, make nontrivial inferences, develop and use scientific theories, make laws, and adapt to complex dynamic environments. Much of this knowledge requires concepts and this study focuses on how people acquire concepts. It is argued that conceptual development progresses from simple perceptual grouping to highly abstract scientific concepts. This proposal of conceptual development has four parts. First, it is argued that categories in the world have different structure. Second, there might (...) be different learning systems that evolved to learn categories of differing structures. Third, these systems exhibit differential maturational course, which affects how categories of different structures are learned in the course of development. And finally, an interaction of these components may result in the developmental transition from perceptual groupings to more abstract concepts. This study reviews a large body of empirical evidence supporting this proposal. (shrink)

Le merite de cette etude est son refus de reduire la theologie d'Eckhart au developpement systematique d'une seule notion fondamentale. Mais cette theologie n'y est pas non plus concue comme une sorte d'eclectisme ou chacune de ces notions aurait sa place et trouverait successivement son tour. S'il y a chez Eckhart une notion fondamentale, c'est celle de Dieu, ou, plutot, c'est celle de l'ineffabilite de Dieu. Dieu est l'etre, assurement, mais n'est-il pas plutot l'Un? Ou l'Intellect? Comprendre qu'il est chacune (...) de ces perfections, absolument, purement, donc en apparence a l'exclusion des autres, c'est justement en quoi consiste l'ignorance transcendante qui eleve Dieu au-dela de toutes les affirmations. Vladimir Lossky a ainsi voulu mettre en lumiere le refus qu'oppose Eckhart a toute tentative d'inclure la divinite dans une notion qui se tiendrait pour suffisante a la definir. (shrink)