Search

Georg Henrik von Wright (1916–2003) started his studies in theoretical philosophy at the University of Helsinki in 1934. His teacher, Professor Eino Kaila (1890–1958), was an associate of the Vienna Circle who had changed the course of Finnish philosophy with his own version of logical empiricism. Under Kaila's supervision, von Wright wrote his early studies on probability and defended his doctoral thesis The Logical Problem of Induction in 1941. Von Wright met Ludwig Wittgenstein in Cambridge in 1939 and 1947 and eventually became his successor there in 1948–1951. Later, von Wright characterized these two philosophers as his "father figures": "Kaila had turned me into a logical positivist or empiricist. Wittgenstein, on the other hand, thoroughly eradicated this personality of mine." This article studies von Wright's changing relation to logical empiricism. The main sources include his correspondence with Kaila in 1937–1958 and his books Den logiska empirismen (in Swedish in 1943; in Finnish in 1945) and Logik, filosofi och språk (in Swedish in 1957, in Finnish in 1958). In his "Intellectual Autobiography" (1989), von Wright described the former book as "a farewell to the philosophy of my student years". Wittgenstein's influence can be seen in von Wright's denial of the unity of science and his cool cultural pessimism as expressed in his critical essays. But it is also evident that logic and exact thinking continued to be central tools and ingredients of his subsequent and highly appreciated work as an analytic philosopher. [ABSTRACT FROM AUTHOR]

Game comonads, introduced by Abramsky, Dawar and Wang and developed by Abramsky and Shah, give an interesting categorical semantics to some Spoiler-Duplicator games that are common in finite model theory. In particular they expose connections between one-sided and two-sided games, and parameters such as treewidth and treedepth and corresponding notions of decomposition. In the present paper, we expand the realm of game comonads to logics with generalised quantifiers. In particular, we introduce a comonad graded by two parameters n ≤ k such that isomorphisms in the resulting Kleisli category are exactly Duplicator winning strategies in Hella's n-bijection game with k pebbles. We define a one-sided version of this game which allows us to provide a categorical semantics for a number of logics with generalised quantifiers. We also give a novel notion of tree decomposition that emerges from the construction. [ABSTRACT FROM AUTHOR]

This paper introduces a logic language LCA as a model of one-dimensional d-state m-neighborhood cellular automata (CAs) with d, m ≥ 2. We first develop the syntax of LCA, and then semantics are given to LCA in the domain of all d-ary strings. It is shown that the finite CAs of any d and m are models of the proposed logic language under any boundary condition. Classical CAs, which are defined over an infinite lattice, are also shown to be models of LCA under two popular classes of configurations: finite and periodic. The proposed logical model further guides us to develop a new class of CAs, which we name homoasynchronous CAs, where a group of (nearby) cells with homogeneous configurations can be updated independently during evolution. [ABSTRACT FROM AUTHOR]

We describe a general approach to deriving linear-time logics for a wide variety of state-based, quantitative systems, by modelling the latter as coalgebras whose type incorporates both branching and linear behaviour. Concretely, we define logics whose syntax is determined by the type of linear behaviour, and whose domain of truth values is determined by the type of branching behaviour, and we provide two semantics for them: a step-wise semantics akin to that of standard coalgebraic logics, and a path-based semantics akin to that of standard linear-time logics. The former semantics is useful for model checking, whereas the latter is the more natural semantics, as it measures the extent with which qualitative properties hold along computation paths from a given state. Our main result is the equivalence of the two semantics. We also provide a semantic characterisation of a notion of logical distance induced by these logics. Instances of our logics support reasoning about the possibility, likelihood or minimal cost of exhibiting a given linear-time property. [ABSTRACT FROM AUTHOR]

We propose a simple imperative programming language, ERC, that features arbitrary real numbers as primitive data type, exactly. Equipped with a denotational semantics, ERC provides a formal programming language-theoretic foundation to the algorithmic processing of real numbers. In order to capture multi-valuedness, which is well-known to be essential to real number computation, we use a Plotkin powerdomain and make our programming language semantics computable and complete: all and only real functions computable in computable analysis can be realized in ERC. The base programming language supports real arithmetic as well as implicit limits; expansions support additional primitive operations (such as a user-defined exponential function). By restricting integers to Presburger arithmetic and real coercion to the ‘precision’ embedding Z ∋ p 7→ 2p ∈ R, we arrive at a first-order theory which we prove to be decidable and model-complete. Based on said logic as specification language for preconditions and postconditions, we extend Hoare logic to a sound (w.r.t. the denotational semantics) and expressive system for deriving correct total correctness specifications. Various examples demonstrate the practicality and convenience of our language and the extended Hoare logic. [ABSTRACT FROM AUTHOR]

Two semantic paradoxes, the Liar and Curry's paradox, are analysed using a newly developed conception of procedural semantics (semantics according to which the truth of propositions is determined algorithmically), whose main characteristic is its departure from methodological realism. Rather than determining pre-existing facts, procedures are constitutive of them. Of this semantics, two versions are considered: closed (where the halting of procedures is presumed) and open (without this presumption). To this end, a procedural approach to deductive reasoning is developed, based on the idea of simulation. As is shown, closed semantics supports classical logic, but cannot in any straightforward way accommodate the concept of truth. In open semantics, where paradoxical propositions naturally 'belong', they cease to be paradoxical; yet, it is concluded that the natural choice--for logicians and common people alike--is to stick to closed semantics, pragmatically circumventing problematic utterances. [ABSTRACT FROM AUTHOR]

The semantic analysis of conditional sentences does not entirely align with their morphosyntactic structure. I substantiate this hypothesis with instances from both Czech and English that extend beyond conventional textbook examples. I also highlight that logicians and philosophers often make terminological errors when they disregard the insights from linguistic disciplines. Despite the early analytic philosophy’s emphasis on terminological precision, the practical application falls significantly short of this ideal. I firmly believe that a proper understanding of the morphosyntax and semantics of conditional sentences is a prerequisite for their classification and analysis. In our pursuit of a comprehensive exploration of conditional clauses, we must also grapple with methodological challenges that delve into the very core of the philosophy of language. The primary issue revolves around the fact that two out of the three a priori methods in philosophy rely heavily on the analysis of conditional sentences: thought experiments and modal metaphysics. [ABSTRACT FROM AUTHOR]

The semantic analysis of conditional sentences does not entirely align with their morphosyntactic structure. I substantiate this hypothesis with instances from both Czech and English that extend beyond conventional textbook examples. I also highlight that logicians and philosophers often make terminological errors when they disregard the insights from linguistic disciplines. Despite the early analytic philosophy’s emphasis on terminological precision, the practical application falls significantly short of this ideal. I firmly believe that a proper understanding of the morphosyntax and semantics of conditional sentences is a prerequisite for their classification and analysis. In our pursuit of a comprehensive exploration of conditional clauses, we must also grapple with methodological challenges that delve into the very core of the philosophy of language. The primary issue revolves around the fact that two out of the three a priori methods in philosophy rely heavily on the analysis of conditional sentences: thought experiments and modal metaphysics.

Artificial intelligence (AI) has posed numerous legal--ethical challenges. These challenges are particularly acute when dealing with AI demonstrating substantial computational prowess, which is then correlated with agency or autonomy. A common response to considering this issue is to inquire whether an AI system is "conscious" or not. If it is, then it could constitute an agent, actor, or person. This framing is, however, unhelpful since there are many unresolved questions about consciousness. Instead, a practical approach is proposed, which could be used to better regulate new AI technologies. The value of the practical approach in this study is that it (1) provides an empirically observable, testable framework that contains predictive value; (2) is derived from a data-science framework that uses semantic information as amarker; (3) relies on a self-referential logic which is fundamental to agency; (4) enables the "grading" or "ranking" of AI systems, which provides an alternative method (as opposed to current risk-tiering approaches) and measure to determine the suitability of an AI system within a specific domain (e.g., such as social domains or emotional domains); (5) presents consistent, coherent, and higher informational content as opposed to other approaches; (6) fits within the conception of what informational content "laws" are to contain and maintain; and (7) presents a viable methodology to obtain "agency", "agent", and "personhood", which is robust to current and future developments in AI technologies and society. [ABSTRACT FROM AUTHOR]

Copyright of Alustath is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The development of sensor networks allows for easier time series data acquisition in industrial production. Due to the redundancy and rapidity of industrial time series data, accurate anomaly detection is a complex and important problem for the efficient production of the textile process. This paper proposed a semantic inference method for anomaly detection by constructing the formal specifications of anomaly data, which can effectively detect exceptions in process industrial operations. Furthermore, our method provides a semantic interpretation of exception data. Hybrid signal temporal logic (HSTL) was proposed to improve the insufficient expressive ability of signal temporal logic (STL) systems. The epistemic formal specifications of fault offline were determined, and a data-driven semantic anomaly detector (SeAD) was constructed, which can be used for online anomaly detection, helping people understand the causes and effects of anomalies. Our proposed method was applied to time-series data collected from a representative textile plant in Zhejiang Province, China. Comparative experimental results demonstrated the feasibility of the proposed method. [ABSTRACT FROM AUTHOR]

We consider an approach to propositional synonymy in proof-theoretic semantics that is defined with respect to a bilateral G3-style sequent calculus SC2Int for the bi-intuitionistic logic 2Int. A distinctive feature of SC2Int is that it makes use of two kinds of sequents, one representing proofs, the other representing refutations. The structural rules of SC2Int, in particular its cut rules, are shown to be admissible. Next, interaction rules are defined that allow transitions from proofs to refutations, and vice versa, mediated through two different negation connectives, the well-known implies-falsity negation and the less well-known coimplies-truth negation of 2Int. By assuming that the interaction rules have no impact on the identity of derivations, the concept of inherited identity between derivations in SC2Int is introduced and the notions of positive and negative synonymy of formulas are defined. Several examples are given of distinct formulas that are either positively or negatively synonymous. It is conjectured that the two conditions cannot be satisfied simultaneously. [ABSTRACT FROM AUTHOR]

A key question in the philosophy of logic is how we have epistemic justification for claims about logical entailment (assuming we have such justification at all). Justification holism asserts that claims of logical entailment can only be justified in the context of an entire logical theory, e.g., classical, intuitionistic, paraconsistent, paracomplete etc. According to holism, claims of logical entailment cannot be atomistically justified as isolated statements, independently of theory choice. At present there is a developing interest in--and endorsement of--justification holism due to the revival of an abductivist approach to the epistemology of logic. This paper presents an argument against holism by establishing a foundational entailment-sentence of deduction which is justified independently of theory choice and outside the context of a whole logical theory. [ABSTRACT FROM AUTHOR]

This paper presents a technique, named STLCG, to compute the quantitative semantics of Signal Temporal Logic (STL) formulas using computation graphs. STLCG provides a platform which enables the incorporation of logical specifications into robotics problems that benefit from gradient-based solutions. Specifically, STL is a powerful and expressive formal language that can specify spatial and temporal properties of signals generated by both continuous and hybrid systems. The quantitative semantics of STL provide a robustness metric, that is, how much a signal satisfies or violates an STL specification. In this work, we devise a systematic methodology for translating STL robustness formulas into computation graphs. With this representation, and by leveraging off-the-shelf automatic differentiation tools, we are able to efficiently backpropagate through STL robustness formulas and hence enable a natural and easy-to-use integration of STL specifications with many gradient-based approaches used in robotics. Through a number of examples stemming from various robotics applications, we demonstrate that STLCG is versatile, computationally efficient, and capable of incorporating human-domain knowledge into the problem formulation. [ABSTRACT FROM AUTHOR]

This article aims at providing some extension of the modal square of opposition in the light of Ockham's account of modal operators. Moreover, we set forth some significant remarks on the de re–de dicto distinction and on the modal operator of contingency by means of a set-theoretic algebra called numbering semantics. This generalization starting from Ockham's account of modalities will allow us to take into consideration whether Ockham's account holds water or not, and in which case it should be changed. [ABSTRACT FROM AUTHOR]

The study is devoted to the study of the role of paradoxes in the novels written by I. Ilf and Eu. Petrov «The Little Golden Calf» and «The Twelve Chairs». In this aspect, the novels that have become world classics have not yet been the subject of detailed scientific study; an attempt to fill this gap determines the relevance of this article. The concepts of «antinomy», «dichotomy», and «intentionality» are considered. The study of the elements of paradoxes, their step-by-step tracing allows to reveal hidden meanings, the vertical context provides a better understanding of the linguistic personality of the characters and the author’s message. The paradoxical nature of evaluative characteristics can manifest itself not only in a horizontal context, but also in a vertical, diachronic one. The contexts containing the paradox extracted from the texts of the indicated novels were selected as the material of the study. The article concludes that in the language of literary works the paradox is used expressly, intentionally, it reflects the linguo-creative thinking of the authors, used as a stylistic device to create the image of a character, as an individualization of his speech, and also performs numerous other functions. It was revealed that the paradoxes used for the image of the main character, O. Bender, who is a strong linguistic personality, represent one set of qualities, and for Panikovsky - another. The paradoxical statements coming from Bender and the speech of other characters in the novels by I. Ilf and Eu. Petrov are psychological, they become persuasive arguments for situation awareness, a means of calming, creating the appearance of a lack of violence against the victim to cover up their own plans.

Dung’s argumentation frameworks are formalisms widely used to model interaction among arguments. Although their study has been profusely developed in the field of Artificial Intelligence, it is not common to see its treatment among those less connected to computer science within the logical-philosophical community. In this paper we propose to bring to that audience a proof-theory for argument justification based on tableaux, very similar to those the Logic students are familiar with. The tableaux enable to calculate whether an argument or subset of arguments are accepted or rejected in accordance to Dung’s preferred and grounded extension-based semantics. Soundness and completeness results regarding those semantics are provided. [ABSTRACT FROM AUTHOR]

We combine "ownership transfer" with matching logic to reason about fault-free partial correctness of shared-memory concurrent programs. As we all know, what really gives separation logic (concurrent separation logic) an edge is the ownership transfer of the heap. Inspired by this, we use matching logic to realize variable ownership (permission) and its transfer mechanism, which reveals the hidden principle behind "protected variables" of resource and "rely set" in extended CSL. In addition, variable ownership can replace Dijkstra's semaphore blocking technique to achieve the critical section. Soundness is important to us, we provide a semantic model that supports the separation property and demonstrate the soundness of our logic based on trace semantics. [ABSTRACT FROM AUTHOR]

G3 is Gödelian 3-valued logic, G3Ł≤ is its paraconsistent counterpart and G3Ł≤ is a strong extension of G3Ł≤. The aim of this paper is to endow each one of the logics just mentioned with a 2 set-up binary Routley semantics. [ABSTRACT FROM AUTHOR]

The paraconsistent and paracomplete 4-valued logic PŁ4 is originally interpreted with a two-valued Belnap-Dunn semantics. In the present paper, PŁ4 is endowed with both a ternary Routley-Meyer semantics and a binary Routley semantics together with their respective restriction to the 2 set-up case. [ABSTRACT FROM AUTHOR]

G3 is Gödelian 3-valued logic, G3Ł≤ is its paraconsistent counterpart and G3Ł≤ is a strong extension of G3Ł≤. The aim of this paper is to endow each one of the logics just mentioned with a 2 set-up binary Routley semantics. [ABSTRACT FROM AUTHOR]

We demonstrate the first recurrent neural network architecture for learning signal temporal logic (TL) formulas, and present the first systematic comparison of formula inference methods. Legacy systems embed much expert knowledge which is not explicitly formalized. There is great interest in learning formal specifications that characterize the ideal behavior of such systems—that is, formulas in TL that are satisfied by the system’s output signals. Such specifications can be used to better understand the system’s behavior and improve the design of its next iteration. Previous inference methods either assumed certain formula templates, or did a heuristic enumeration of all possible templates. This work proposes a neural network architecture that infers the formula structure via gradient descent, eliminating the need for imposing any specific templates. It combines the learning of formula structure and parameters in one optimization. Through systematic comparison, we demonstrate that this method achieves similar or better misclassification rates (MCRs) than enumerative and lattice methods. We also observe that different formulas can achieve similar MCR, empirically demonstrating the under-determinism of the problem of TL inference. [ABSTRACT FROM AUTHOR]

Online monitoring is a popular validation approach in which the temporal behavior of a system is checked to assess whether it satisfies a given specification expressed, e.g., in signal temporal logic (STL). This is done by employing a monitor that, at each time point, states the specification validity: satisfied, violated, or unknown. In some settings, monitoring should continue even after a violation episode is detected, to detect possible future violation episodes. However, for a monitor just relying on STL semantics, this is not possible, as, once the specification is violated by an input signal, any continuation of the signal still violates the specification. To tackle this problem, we here propose an optimal reset technique that, at runtime, detects the end of a violation episode and shifts the evaluation of the monitor to skip such an episode. In this way, the monitoring can continue to detect possible other future violation episodes. We propose a framework that integrates the reset technique with an existing monitoring approach. Experiments on two Simulink models show that the technique can effectively reset the monitor and report all the violation episodes, with a negligible overhead on the monitoring cost. [ABSTRACT FROM AUTHOR]

Abstract In this paper I critically address some ideas presented in Patrick Duffley’s book Linguistic Meaning Meets Linguistic Form. Duffley adopts the semiological principle that linguistic signs have stable meanings. I argue that this principle leads Duffley to an artificial description of the meaning of the preposition for, in attempting to avoid the charge of polysemy. Another issue is that the principle is not consistently followed throughout the book, such as in Duffley’s analysis of the meaning of start, or in his acceptance of words with encyclopedic meanings. I also point out that the proposed meaning of start and the view that the meaning of some words is encyclopedic have problems of their own.

Abstract In this introduction we present Patrick Duffley's book Linguistic Meaning meets Linguistic Form, as well as the contributions that each scholar has brought into the debate on linguistic meaning and form. They deal with semantic and foundational issues regarding a sign-based approach to meaning.

It has been increasingly recognized that identifying roles of formulas of a knowledge base in the inconsistency of that base can help us better look inside the inconsistency. However, there are few approaches to identifying such roles of formulas from a perspective of models in some paraconsistent logic, one of typical tools used to characterize inconsistency in semantics. In this paper, we characterize the role of each formula in the inconsistency arising in a knowledge base from informational as well as causal aspects in the framework of Priest's minimally inconsistent logic of paradox. At first, we identify the causal responsibility of a formula for the inconsistency based on the counterfactual dependence of the inconsistency on the formula under some contingency in semantics. Then we incorporate the change on semantic information in the framework of causal responsibility to develop the informational responsibility of a formula for the inconsistency to capture the contribution made by the formula for the inconsistent information. This incorporation makes the informational responsibility interpretable from the point of view of causality, and capable of catching the role of a formula in inconsistent information concisely. In addition, we propose notions of naive and quasi naive responsibilities as two auxiliaries to describe special relations between inconsistency and formulas in semantic sense. Some intuitive and interesting properties of the two kinds of responsibilities are also discussed. • Research highlight 1: We characterize the role of a formula in the inconsistency of a knowledge base by using paraconsistent semantics. • Research highlight 2: We consider both the semantic information and causality in describing the role of each formula in the inconsistency. • Research highlight 3: The characterization of the role of each formula in the inconsistency in a knowledge base has good interpretability. [ABSTRACT FROM AUTHOR]

In this article, we address a multi-robot planning problem in environments with partially unknown semantics. The environment is assumed to have a known geometric structure (e.g., walls) and to be occupied by static labeled landmarks with uncertain positions and classes. This modeling approach gives rise to an uncertain semantic map generated by semantic simultaneous localization and mapping algorithms. Our goal is to design control policies for robots equipped with noisy perception systems so that they can accomplish collaborative tasks captured by global temporal logic specifications. To specify missions that account for environmental and perceptual uncertainty, we employ a fragment of linear temporal logic (LTL), called co-safe LTL, defined over perception-based atomic predicates modeling probabilistic satisfaction requirements. The perception-based LTL planning problem gives rise to an optimal control problem, solved by a novel sampling-based algorithm, that generates open-loop control policies that are updated online to adapt to a continuously learned semantic map. We provide extensive experiments to demonstrate the efficiency of the proposed planning architecture. [ABSTRACT FROM AUTHOR]

Abstract In this review I provide a brief analysis of the main features of the collective volume Shifting Concepts (Oxford University Press, 2020), edited by Teresa Marques and Åsa Wikforss. The volume addresses several related topics, and it contains contributions from psychologists and philosophers. It deals with the topic of concept variation understood in a broad sense, for it tackles diachronic, contextual, interpersonal and even intrapersonal variation; besides, the second part of the book is devoted to the topic of concept revision and amelioration. I provide a brief description of the book and then I critically assess each of the contributions.

Model checking is well known to be a computer-aided method for verifying concurrent systems. Temporal logics and their Kripke-style semantics have been widely used in model checking. Falsification-aware Kripke-style semantics for temporal logics have been required for the theoretical basis of model checking because falsification plays a critical role in obtaining counterexample traces for the underlying object specifications in model checking. However, a useful falsification-aware Kripke-style semantics has yet to be developed for standard temporal logics. Hence, this study introduces two types of falsification-aware Kripke-style semantics for standard temporal logics that have been typically used in model checking. The equivalences among the proposed falsification-aware and standard Kripke-style semantics for standard temporal logics are proved. Furthermore, some inconsistency-tolerant subsystems of standard temporal logics are semantically obtained from the proposed falsification-aware Kripke-style semantics for standard temporal logics by deleting a characteristic condition on the labeling function of the semantics. The proposed semantic framework for standard and inconsistency-tolerant temporal logics is regarded as a unified framework for generalizing and combining the existing standard, inconsistency-tolerant, and many-valued semantic frameworks. This unified semantic framework is useful for obtaining a theoretical basis for generalized (inconsistency-tolerant) model checking, referred to here as falsification-aware model checking. [ABSTRACT FROM AUTHOR]

We present a finitary version of Moss’ coalgebraic logic for T-coalgebras, where T is a locally monotone endofunctor of the category of posets and monotone maps. The logic uses a single cover modality whose arity is given by the least finitary subfunctor of the dual of the coalgebra functor T ∂ , and the semantics of the modality is given by relation lifting. For the semantics to work, T is required to preserve exact squares. For the finitary setting to work, Tω, and the semantics of the modality is given by relation lifting. For the semantics to work, T is required to preserve exact squares. For the finitary setting to work, T∂X. This in particular allows us to talk about the finite poset of subformulas for a given formula. The notion of a base is introduced generally for a category equipped with a suitable factorisation system. We prove that the resulting logic has the Hennessy-Milner property for the notion of similarity based on the notion of relation lifting. We define a sequent proof system for the logic, and prove its completeness. [ABSTRACT FROM AUTHOR] ω is required to preserve finite intersections. We develop a notion of a base for subobjects of TωX. This in particular allows us to talk about the finite poset of subformulas for a given formula. The notion of a base is introduced generally for a category equipped with a suitable factorisation system. We prove that the resulting logic has the Hennessy-Milner property for the notion of similarity based on the notion of relation lifting. We define a sequent proof system for the logic, and prove its completeness. [ABSTRACT FROM AUTHOR]

In this paper we present a tableau system for deontic logics with the operator of explicit permission. By means of this system the decidability of the considered logics can be proved. We will sketch how these logics are semantically defined by means of relating semantics and how they provide a simple solution to the free choice permission problem. In short, these logics employ relating implication and a certain propositional constant. These two are in turn used to define deontic operators similarly as in Andersonian-Kangerian reduction, which uses different intensional implications and constants. [ABSTRACT FROM AUTHOR]

This article deals with an alternative interpretation of syllogistics, different from the classical (extensional) one: an intensional one, in which subject and predicate are not associated with a set of individuals (the extension of the concept) but a set of attributes (the content of the concept). The authors of the paper draw attention to the fact that this approach was first proposed by Leibniz in works on logical calculus, which for a long time remained in the shadow of his other philosophical works. Currently, the intensional approach is gaining more and more popularity due to the development of non-classical logics, and the article will present several existing intensional formal syllogistic semantics. The paper will also consider another historical approach to syllogistics, associated with the name of the Russian logician Nikolai Vasiliev, who is not only one of the founders of non-classical (non-Aristotelian logic) but also of a different intensional interpretation of such logic. The authors, along with the already known formalizations of Vasiliev's ideas, present two new systems. One of them is a reconstruction of one type of imaginary logic with statements of three qualities: affirmative and two types of negative statements (with absolute and ordinary negation). The second system is the one that is adequate to semantics, in which instead of the four classical ones, only three types of statements are presented (two particular statements are replaced by one -- accidental), and their significance is determined through the relation of the classical logical entailment. Both of them are interpreted intensionally. The intensional approach in logic and, in particular, in syllogistics allows us to expand the class of accepted principles (which occurs due to the expansion of the class of correct moods of syllogisms). [ABSTRACT FROM AUTHOR]

Dealing with controversial information is an important issue in several application contexts. Formal argumentation enables reasoning on arguments for and against a claim to decide on an outcome. Dung's abstract Argumentation Framework (AF) has emerged as a central formalism in argument-based reasoning. Key aspects of the success and popularity of Dung's framework include its simplicity and expressiveness. Integrity constraints help to express domain knowledge in a compact and natural way, thus keeping easy the modeling task even for problems that otherwise would be hard to encode within an AF. In this paper, we first explore two intuitive semantics based on Kleene and Lukasiewicz logics, respectively, for AF augmented with (strong) constraints—the resulting argumentation framework is called Constrained AF (CAF). Then, we propose a new argumentation framework called Weak constrained AF (WAF) that enhances CAF with weak constraints. Intuitively, these constraints can be used to find "optimal" solutions to problems defined through CAF. We provide a detailed complexity analysis of CAF and WAF, showing that strong constraints do not increase the expressive power of AF in most cases, while weak constraints systematically increase the expressive power of CAF (and AF) under several well-known argumentation semantics. [ABSTRACT FROM AUTHOR]

The logic BN4 was defined by R.T. Brady as a four-valued extension of Routley and Meyer’s basic logic B. The system EF4 is defined as a companion to BN4 to represent the four-valued system of (relevant) implication. The system Ł was defined by J. Łukasiewicz and it is a four-valued modal logic that validates what is known as strong Łukasiewicz-type modal paradoxes. The systems EF4-M and EF4-Ł are defined as alternatives to Ł without modal paradoxes. This paper aims to define a Belnap-Dunn semantics for EF4, EF4-M and EF4-Ł. It is shown that EF4, EF4-M and EF4-Ł are strongly sound and complete w.r.t. their respective semantics and that EF4-M and EF4-Ł are free from strong Łukasiewicz-type modal paradoxes. [ABSTRACT FROM AUTHOR]

The logics BN4 and E4 can be considered as the 4-valued logics of the relevant conditional and (relevant) entailment, respectively. The logic BN4 was developed by Brady in 1982 and the logic E4 by Robles and Méndez in 2016. The aim of this paper is to investigate the implicative variants (of both systems) which contain Routley and Meyer’s logic B and endow them with a Belnap-Dunn type bivalent semantics. [ABSTRACT FROM AUTHOR]

In this paper, some characterizations of fuzzifying strong compactness are given, including characterizations in terms of nets and presubbases. Several characterizations of locally strong compactness in the framework of fuzzifying topology are introduced and the mapping theorems are obtained. [ABSTRACT FROM AUTHOR]

Copyright of Cognitio - Revista de Filosofia is the property of Cognitio - Revista de Filosofia and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this article, we present an approach based on counterexample-guided abstraction refinement to verifying full regular temporal properties of C programs by means of combining both static analysis and dynamic verification. To this end, a desired property is specified by a propositional projection temporal logic formula $p$ , and the labeled normal form graph (LNFG) of $\lnot p$ is automatically produced. Furthermore, the control flow automaton of the C program is constructed, and an enriched abstract reachability tree is generated under the guidance of the LNFG. Throughout the construction of the eART, whenever a candidate counterexample $cp$ is found, a verification input w.r.t $cp$ is generated by the SMT solver Z3. Subsequently, the C program is converted into a modeling, simulation, and verification language (MSVL) program $m$ , and $\lnot p$ is also transformed to an MSVL program $m^{\prime }$. As a result, $m\; \text{and} \;m^{\prime }$ is executed to check whether the counterexample is spurious. The $cp$ is returned if it is a real counterexample; otherwise, the eART is refined. This process is repeated until no counterexample is found, namely the property is valid, or the counterexample is a real one The proposed approach enables us to not only verify full regular properties of C programs, but also produce precise results, neither false negatives nor false positives. The approach has been implemented in a tool named SDMC. Experiments show that SDMC outperforms the relevant tools available. [ABSTRACT FROM AUTHOR]

Here, we discuss historical, philosophical and technical problems associated with relating logic and relating semantics. To do so, we proceed in three steps. First, Section 1 is devoted to providing an introduction to both relating logic and relating semantics. Second, we address the history of relating semantics and some of the main research directions and their philosophical applications. Third, we discuss some technical problems related to relating semantics, particularly whether the direct incorporation of the relation into the language of relating logic is needed. The starting point for our considerations presented here is the 1st Workshop On Relating Logic and the selected papers for this issue. [ABSTRACT FROM AUTHOR]

The aim of this paper is to explore the advantages deriving from the application of relating semantics in epistemic logic. As a first step, I will discuss two versions of relating semantics and how they can be differently exploited for studying modal and epistemic operators. Next, I consider several standard frameworks which are suitable for modeling knowledge and related notions, in both their implicit and their explicit form, and present a simple strategy by virtue of which they can be associated with intuitive systems of relating logic. As a final step, I will focus on the logic of knowledge based on justification logic and show how relating semantics helps us to provide an elegant solution to some problems related to the standard interpretation of the explicit epistemic operators. [ABSTRACT FROM AUTHOR]

In this paper we present the history of and the research directions in relating logic. For this purpose we will describe Epstein's Programme, which postulates accounting for the content of sentences in logical research. We will focus on analysing the content relationship and Epstein's logics that are based on it, which are special cases of relating logic. Moreover, the set-assignment semantics will be discussed. Next, the Torunian Programme of Relating Semantics will be presented; this programme explores the various non-logical relationships in logical research, including those which are content-related. We will present a general description of relating logic and semantics as well as the most prominent issues regarding the Torunian Programme, including some of its special cases and the results achieved to date. [ABSTRACT FROM AUTHOR]

The similarity between logic and semantics of the Stoics and Frege has long been known, and it can be explained in various ways. In 2021, Susane Bobzien published a work in which she explains this similarity rather surprisingly: she hypothesizes that Frege generously helped himself with the foundations of Stoic logic as it was published in the first volume of History of Logic in the West by Carl Prantl. However, this hypothesis encounters various problems. The key point of the whole accusation is founded on the formulation of a general proposition in language using implication and anaphora, which Frege supposedly took from the Stoics, although in Prantl's text there is only one example of a sentence with this structure. On the contrary, there are many examples of such sentences in contemporary professional (e.g. legal) texts. Many examples of semantic similarities that Bobzien presents are based only on the similarities between isolated concepts; however, that is regularly the case for such concepts with the same conceptual basis. Bobzien presents a significant number of matches only on the basis of results that could allegedly be inferred from the texts. However, this cannot be considered a proof of plagiarism. Bobzien does not consider many sources for the continuity of interpretation such as the so-called hypothetical syllogism found in available textbooks of logic. Last but not least, her claims do not consider many differences between Stoic and Frege's logic. All this leads us to the conclusion that Bobzien does not present sufficient facts and connections between them that would confirm her hypothesis about Frege's plagiarism of the Stoic logic: Frege simply was not a plagiarist. [ABSTRACT FROM AUTHOR]

In Franceschi (2002), I presented a theory based on the matrices of concepts aiming at providing an alternative to the classification proposed by Greimas, in the field of paradigmatic analysis. The problem of specifying the relationships of the concepts of love, hate and indifference, arises in this construction. I attach myself to describe the problem of the love-hate-indifference relationships in detail, and several solutions that have been proposed to solve it. Finally I expose a solution to this problem, based on an extension of the theory of matrices of concepts.

Two interdependent phenomena are questioned: what allows, ecologically, the subject-environment relation then, the dynamics of this relation. To do this, two scientific currents are mobilized: affordance in its current meaning and the sociology of translation. While each of these currents has its own semantics and epistemology, both initiate breaks in the way of understanding what occurs within human activity and contribute to an ecological approach based on a fundamental principle: all human activity is situated and dynamic, characterizing the processes implemented by the actors according to the properties, in part, perceived of their socio-cultural environment. All deterministic logic is then set aside to place, on the same plane, all the dynamic entities within an environment, whether or not they are perceived by the actors on the ground. [ABSTRACT FROM AUTHOR]

After putting forward a formal account of value disagreement via imprecise measures, I develop a logic of value attribution and of (dis)agreement based on (exact) truthmaker semantics. [ABSTRACT FROM AUTHOR]

This paper gives a semantics for schematic logic, proving soundness and completeness. The argument for soundness is carried out in ontologically innocent fashion, relying only on the existence of formulae which are actually written down in the course of a derivation in the logic. This makes the logic available to a nominalist, even a nominalist who does not wish to rely on modal notions, and who accepts the possibility that the universe may in fact be finite. [ABSTRACT FROM AUTHOR]