Search

In this paper we define the notion of possibly paraconsistent sets. We introduce algebraic operations on them and we analyze their properties. Moreover, it is shown that our class can be considered as isomorphic to the classes of intuitionistic and weak rough sets (with the assumption that intersection, union and complement are understood in an appropriate manner). Hence, the framework of paraconsistent sets can be treated as a new semantics for three-valued logic. Two less typical operations on possibly paraconsistent sets are studied too. They do not give us de Morgan algebra but rather a bisemilattice with only one absorption law. Finally, we pay attention to the fact that possibly paraconsistent sets can be treated as neutrosophic crisp sets of type 2. As for the exact isomorphism, it should be a matter of further research. [ABSTRACT FROM AUTHOR]

Given any set E of expressions freely generated from a set of atoms by syntactic operations, there exist trivially compositional functions on E (to wit, the injective and the constant functions), but also plenty of non-trivially compositional functions. Here we show that within the space of non-injective functions (and so a fortiori within the space of non-injective and non-constant functions), compositional functions are not sufficiently abundant in order to generate the consequence relation of every propositional logic. Logical consequence relations thus impose substantive constraints on the existence of compositional functions when coupled with the condition of non-injectivity (though not without it). We ask how the apriori exclusion of injective functions from the search space might be justified, and we discuss the prospects of claims to the effect that any function can be "encoded" in a compositional one. [ABSTRACT FROM AUTHOR]

• Neuroticism contributes to the development and maintenance of emotional disorders. • The UP targets shared mechanisms of neuroticism and related emotion dysregulation. • The UP is an effective treatment for emotional disorders and neuroticism. • The UP can address a variety of problems across different cultures and identities. Before the development of the Unified Protocol for the Transdiagnostic Treatment of Emotional Disorders (UP), evidence-based treatment options for commonly co-occurring anxiety, mood, and related disorders consisted of numerous single-disorder protocols that shared many similarities, reflecting the overlap among these disorders themselves. The UP distilled common elements of cognitive behavioral protocols into a unified intervention directly targeting core temperamental features underlying these disorders of emotion, namely neuroticism and associated emotion dysregulation. The UP has since become a leading "transdiagnostic" treatment for emotional disorders, which is now available in several formats (e.g., individual, group, digital) and has accumulated a strong evidence base, leading to international implementation. There is now also research evidence that the UP can be flexibly applied to a range of clinical presentations, including borderline personality disorder, trauma- and stressor-related disorders, eating disorders, alcohol use disorder, and comorbid chronic physical health conditions. Yet additional research is needed to evaluate the UP in routine clinical settings, with more heterogeneous patient populations, and under circumstances that mirror actual clinical practice. Thus, we must also continue to explore the benefits of large-scale UP training initiatives and implementation in major healthcare systems. [ABSTRACT FROM AUTHOR]

Copyright of Russian Linguistics is the property of Springer Nature 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.)

We present a neighbourhood-style semantic framework for modal epistemic logic modelling agents who process information using relevant logic. The distinguishing feature of the framework in comparison to relevant modal logic is that the environment the agent is situated in is assumed to be a classical possible world. This framework generates two-layered logics combining classical logic on the propositional level with relevant logic in the scope of modal operators. Our main technical result is a general soundness and completeness theorem. [ABSTRACT FROM AUTHOR]

The debate between the revisionist and received views of the relationship between Thomas Kuhn and logical empiricism has until now focused on the relationship between Kuhn and Rudolf Carnap. Here, I consider the relationship between Kuhn and two other members of the Vienna Circle's left-wing; Otto Neurath and Philipp Frank. It is argued that the attribution of the historical turn in philosophy of science to Kuhn obscures the historical awareness displayed in important works by members of the Vienna Circle, and thereby distorts its legacy. Both Frank and Neurath recognised the role for history in theorizing about science, and drawing upon these insights lead them to considerations of scientific theory-choice, rational disagreement, and the role of extra-scientific values in science, that anticipate those later made famous by Kuhn. It is also argued that the Left-Vienna Circle's programme for Unified Science, the replacement of traditional philosophy with a bipartite metatheory of science, provides a clearer and potentially more radical role for the history of science within the philosophy of science than Kuhn's. To reach this conclusion, it is demonstrated that some members of the Vienna Circle maintained a far less robust distinction between contexts of discovery and justification than has typically been attributed to them. [ABSTRACT FROM AUTHOR]

Much work in philosophy, psychology, and neuroscience has argued for continuism about remembering and imagining (see, e.g., Addis J R Soc N Z 48(2–3):64–88, 2018). This view claims that episodic remembering is just a form of imagining, such that memory does not have a privileged status over other forms of episodic simulation (esp. imagination). Large parts of contemporary philosophy of memory support continuism. This even holds for work in semantics and the philosophy of language, which has pointed out substantial similarities in the distribution of the verbs remember and imagine. Our paper argues against the continuist claim, by focusing on a previously neglected source of evidence for discontinuism: the semantics of episodic memory and imagination reports. We argue that, in contrast to imagination reports, episodic memory reports are essentially diachronic, in the sense that their truth requires a foregoing reference-fixing experience. In this respect, they differ from reports of experiential imagination, which is paradigmatically synchronic. To defend our claim about this difference in diachronicity, we study the truth-conditions of episodic memory and imagination reports. We develop a semantics for episodic uses of remember and imagine that captures this difference. [ABSTRACT FROM AUTHOR]

The document "Introduction: The Semantics of Imagination" published in the journal "Topoi: An International Review of Philosophy" discusses the recent focus on imagination in semantics and philosophy of language. It explores the semantic properties of the verb "imagine" and its experiential uses, highlighting the challenges in understanding the selectional flexibility, cross-categorial entailments, experiential parasitism, and perspectivity of imagination reports. The document presents various contributions that address these challenges, including discussions on the semantics of German and English imagination verbs, temporal counteridentity reports, and the ontological dependence of intentional objects in imagination reports. [Extracted from the article]

Sequent-style refutation calculi with non-invertible rules are challenging to design because multiple proof-search strategies need to be simultaneously verified. In this paper, we present a refutation calculus for the multiplicative–additive fragment of linear logic (⁠|$\textsf{MALL}$|⁠) whose binary rule for the multiplicative conjunction |$(\otimes)$| and the unary rule for the additive disjunction |$(\oplus)$| fail invertibility. Specifically, we design a cut-free hypersequent calculus |$\textsf{HMALL}$|⁠ , which is equivalent to |$\textsf{MALL}$|⁠ , and obtained by transforming the usual tree-like shape of derivations into a parallel and linear structure. Next, we develop a refutation calculus |$\overline{\textsf{HMALL}}$| based on the calculus |$\textsf{HMALL}$|⁠. As far as we know, this is also the first refutation calculus for a substructural logic. Finally, we offer a fractional semantics for |$\textsf{MALL}$| —whereby its formulas are interpreted by a rational number in the closed interval [0, 1] —thus extending to the substructural landscape the project of fractional semantics already pursued for classical and modal logics. [ABSTRACT FROM AUTHOR]

Showing that a problem is hard for a model of computation is one of the most challenging tasks in theoretical computer science, logic and mathematics. For example, it remains beyond reach to find an explicit problem that cannot be computed by polynomial size propositional formulas (PF). As a model of computation, logic programs (LP) under answer set semantics are as expressive as PF and also \(\mathtt{NP}\) -complete for satisfiability checking. In this article, we show that the PAR problem is hard for LP, i.e., deciding whether a binary string contains an odd number of \(1\) 's requires exponential size LP. The proof idea is first to transform logic programs into equivalent boolean circuits and then apply a probabilistic method known as random restriction to obtain an exponential lower bound. Based on the main result, we generalize a sufficient condition for identifying hard problems for LP and give a separation map for an LP family from a computational point of view, whose members are all equally expressive and share the same reasoning complexity. [ABSTRACT FROM AUTHOR]

We study natural deduction systems for a fragment of intuitionistic logic with propositional identity from the point of view of proof-theoretic semantics. We argue that the identity connective is a natural operator to be treated under the elimination rules as basic approach. [ABSTRACT FROM AUTHOR]

Copyright of Gumushane Universty Electronic Journal of the Faculty of Communication / Gümüshane Üniversitesi Iletisim Fakültesi Elektronik Dergisi is the property of Gumushane Universitesi Iletisim Fakultesi Elektronik Dergisi (e-GIFDER) 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.)

A human-like dialogue system should prioritize expressing empathy towards others, which entails two crucial aspects: (1) semantic cognition and (2) emotion detection. Previous approaches mainly model semantic and emotional dependencies by capturing emotion signal or leveraging external commonsense knowledge. However, they often ignore the syntactic information inherent in the utterances, which is crucial to understanding the subtle differences in the semantic and emotional meaning of words in different contexts. In this paper, we propose a novel framework for empathetic dialogue generation with Knowledge enhanced Dependency Tree (KnowDT). Specifically, the KnowDT captures relationships between token-level emotions by comprehensively considering of dependency tree and external knowledge. To incorporate syntactic and semantic information into context encoding, we improve the relation attention mechanism for a joint representation of adjacent nodes in dependency tree, and design a flexible tree positional encoding scheme for a broad variety of topologies without affecting their syntactic constituents. Furthermore, we present a level-ordered attention mechanism that extracts emotional features by encoding recursively along the topological structure of a dependency tree. Experimental results demonstrate that our model outperforms the state-of-the-art models in both automatic and human evaluation, in which the accuracy of emotion classification and the perplexity of generated responses are significantly improved. [ABSTRACT FROM AUTHOR]

Aspect-level sentiment classification (ALSC) struggles with correctly trapping the aspects and corresponding sentiment polarity of a statement. Recently, several works have combined the syntactic structure and semantic information of sentences for more efficient analysis. The combination of sentence knowledge with graph neural networks has also proven effective at ALSC. However, there are still limitations on how to effectively fuse syntactic structure and semantic information when dealing with complex sentence structures and informal expressions. To deal with these problems, we propose an ALSC fusion network that combines graph neural networks with a simultaneous consideration of syntactic structure and semantic information. Specifically, our model is composed of a syntactic attention module and a semantic enhancement module. First, the syntactic attention module builds a dependency parse tree with the aspect term being the root, so that the model focuses better on the words closely related to the aspect terms, and captures the syntactic structure through a graph attention network. In addition, the semantic enhancement module generates the adjacency matrix through self-attention, which is processed by the graph convolutional network to obtain the semantic details. Lastly, the extracted features are merged to achieve sentiment classification. As verified by experiments, the model we propose can effectively enhance ALSC's behavior. [ABSTRACT FROM AUTHOR]

We prove that the provability logic of all provability predicates is exactly Fitting, Marek, and Truszczyński's pure logic of necessitation |$\textsf{N}$|⁠. Moreover, we introduce three extensions |$\textsf{N4}$|⁠ , |$\textsf{NR}$| and |$\textsf{NR4}$| of |$\textsf{N}$| and investigate the arithmetical semantics of these logics. In fact, we prove that |$\textsf{N4}$|⁠ , |$\textsf{NR}$| and |$\textsf{NR4}$| are the provability logics of all provability predicates satisfying the third condition |$\textbf{D3}$| of the derivability conditions, all Rosser provability predicates and all Rosser provability predicates satisfying |$\textbf{D3}$|⁠ , respectively. [ABSTRACT FROM AUTHOR]

Creating a map style from scratch is challenging. Cartographers may find inspirations from artistic paintings and transfer their style to maps. However, the reference painting and the extracted style elements may not fit well with the content and function of maps, resulting in undesirable or even frustrating map stylization. The question of how to choose appropriate paintings as inspirations and utilize their essential visual elements to stylize maps remains unanswered. As neuroscience has developed, an increasing number of neural mechanisms underlying visual perception have been discovered, deepening our understanding of artistic styles and their adaptation to maps. In this paper, we draw connections between visual neurons and style elements of both artistic paintings and maps by examining seven neural mechanisms (i.e. central-peripheral vision, color-to-contour adhesion, double-opponent effects, visual filling-in, orientation selectivity, latency variation, and what-where separation) that are typical of artistic paintings. We also demonstrate that these mechanisms are transferable to maps. We then create a cartographic style syntactics to generally indicate how and to what degree these mechanisms can be reflected in four cartographic stylistic criteria (i.e. identification, expressiveness, aesthetic appeal and emotional impact). Our work contributes to the integration of principles from neuroscience with cartographic design to deepen our understanding of map perception and to facilitate map style transfer. [ABSTRACT FROM AUTHOR]

Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form p ∧ ◊ ¬ p ('p, but it might be that not p') appears to be a contradiction, ◊ ¬ p does not entail ¬ p , which would follow in classical logic. Likewise, the classical laws of distributivity and disjunctive syllogism fail for epistemic modals. Existing attempts to account for these facts generally either under- or over-correct. Some theories predict that p ∧ ◊ ¬ p , a so-called epistemic contradiction, is a contradiction only in an etiolated sense, under a notion of entailment that does not always allow us to replace p ∧ ◊ ¬ p with a contradiction; these theories underpredict the infelicity of embedded epistemic contradictions. Other theories savage classical logic, eliminating not just rules that intuitively fail, like distributivity and disjunctive syllogism, but also rules like non-contradiction, excluded middle, De Morgan's laws, and disjunction introduction, which intuitively remain valid for epistemic modals. In this paper, we aim for a middle ground, developing a semantics and logic for epistemic modals that makes epistemic contradictions genuine contradictions and that invalidates distributivity and disjunctive syllogism but that otherwise preserves classical laws that intuitively remain valid. We start with an algebraic semantics, based on ortholattices instead of Boolean algebras, and then propose a possibility semantics, based on partial possibilities related by compatibility. Both semantics yield the same consequence relation, which we axiomatize. We then show how to lift an arbitrary possible worlds model for a non-modal language to a possibility model for a language with epistemic modals. The goal throughout is to retain what is desirable about classical logic while accounting for the non-classicality of epistemic vocabulary. [ABSTRACT FROM AUTHOR]

According to Garfield and Priest's interpretation, the positive use of the catuskoti by Nāgārjuna in Mūlamadhyamakakārikā (MMK) shows that he endorses a four-valued semantics similar to that of Belnap's First-Degree Entailment (FDE), while the negative use of the catuskoti by Nāgārjuna in MMK indicates that what he really has in mind is a plurivalent five-valued semantics. This paper argues that their interpretation suffers from a number of problems: adequate logic, collapse of kotis, lack of literature support, and a suitable explanation of the third koti. The final part of the paper combines insights from Westerhoff, Cotnoir, Garfield and Priest together and describes the right interpretation of Nāgārjuna's use of the catuskoti in MMK with the right semantics and the right logic of MMK. The authors argue that Nāgārjuna's 'rebuttal' of all four kotis in a catuskoti should be understood as a mere denial or a mere rejection of these kotis. [ABSTRACT FROM AUTHOR]

The task of machine reading comprehension (MRC) is to enable machine to read and understand a piece of text and then answer the corresponding question correctly. This task requires machine to not only be able to perform semantic understanding but also possess logical reasoning capabilities. Just like human reading, it involves thinking about the text from two interacting perspectives of semantics and logic. However, previous methods based on reading comprehension either consider only the logical structure of the text or only the semantic structure of the text and cannot simultaneously balance semantic understanding and logical reasoning. This single form of reasoning cannot make the machine fully understand the meaning of the text. Additionally, the issue of sparsity in composition presents a significant challenge for models that rely on graph-based reasoning. To this end, a cross-graph knowledge propagation network (CGKPN) with adaptive connection is presented to address the above issues. The model first performs self-view node embedding on the constructed logical graph and semantic graph to update the representations of the graphs. Specifically, a relevance matrix between nodes is introduced to adaptively adjust node connections in response to the challenge posed by sparse graph. Subsequently, CGKPN conducts cross-graph knowledge propagation on nodes that are identical in both graphs, effectively resolving conflicts arising from identical nodes in different views, and enabling the model to better integrate the logical and semantic relationships of the text through efficient interaction. Experiments on the two MRC datasets ReClor and LogiQA indicate the superior performance of our proposed model CGKPN compared to other existing baselines. [ABSTRACT FROM AUTHOR]

The recent series of papers between Sampaio and Haydu (Behavior and Social Issues 32(1):115–133, 2023a; Behavior and Social Issues 32(1):141–146, 2023b) and Ardila-Sánchez and Hayes (Behavior and Social Issues 32(1):134–140, 2023) on the cultural milieu construct is of critical import for culturo-behavior science. By constructing a revised version of Houmanfar and colleagues' (Ardila-Sánchez et al., Behavior and Social Issues 28(1):298–315, 2019: Houmanfar, Ardila-Sánchez, & Alavosius, Behavior science perspectives on culture and community, pp. 151–170, Springer, 2020: Houmanfar & Rodrigues, Behavior and Social Issues, 15(1):13–30, 2006: Houmanfar, Rodrigues, & Ward, Behavior and Social Issues 19(1):78–103, 2010) elaborated metacontingency model, Sampaio and Haydu address confusion inherent in the concept of the cultural milieu by separating it into two different components—cultural antecedents and selecting environment variables—with different functional properties. This allows the cultural milieu to be conceptualized more coherently within a behavior-analytic framework, a framework into which the cultural milieu does not quite fit when described in interbehavioral terms. However, given differences in integrated field and contingency logic, an interbehaviorally conceptualized cultural milieu does not belong in any metacontingency model, elaborated or otherwise. The purpose of this paper is to address this issue—the elephant in the field—and confusing aspects of the cultural milieu that Sampaio and Haydu do not address when one considers the elaborated metacontingency model from an interbehavioral perspective. In doing so, I discuss issues with the model warranting attention and the prospect of a unified culturo-behavior science. [ABSTRACT FROM AUTHOR]

Given the lack of computational tools available for assessing second language (L2) production in Korean, this study introduces a novel automated tool called the Korean Syntactic Complexity Analyzer (KOSCA) for measuring syntactic complexity in L2 Korean production. As an open-source graphic user interface (GUI) developed in Python, KOSCA provides seven indices of syntactic complexity, including traditional and Korean-specific ones. Its validity was tested by investigating whether the syntactic complexity indices measured by it in L2 written and spoken production could explain the variability of L2 Korean learners' proficiency. The results of mixed-effects regression analyses showed that all seven indices significantly accounted for learner proficiency in Korean. Subsequent stepwise multiple regression analyses revealed that the syntactic complexity indices explained 56.0% of the total variance in proficiency for the written data and 54.4% for the spoken data. These findings underscore the validity of the syntactic complexity indices measured by KOSCA as reliable indicators of L2 Korean proficiency, which can serve as a valuable resource for researchers and educators in the field of L2 Korean learning and assessment. [ABSTRACT FROM AUTHOR]

Speech acts in CMC (Computer Mediated Communication) have been receiving increasing attention in recent years. This study attempted to make a cross-cultural comparison of Chinese and American online complaints of restaurants from the perspective of speech act structure in relation to face management. In spite of likeness in the general taxonomy of retrospective and prospective speech acts between the two corpora, addressivity appeared to be a strong factor affecting how face was managed in the specific construction of complaints as speech act sets in the Chinese data set, while such a discrepancy was absent from the American reviews where the face of restaurants and fellow consumers was not handled with much distinction and discretion. These findings in terms of the level of sensitivity and adaptation to the context seem to imply that the generally-recognized distinction of high-context vs. low-context between the two cultures is also manifested in online reviews. [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 presents a novel concept of a polyatomic logic and initiates its systematic study. This approach, inspired by inquisitive semantics, is obtained by taking a variant of a given logic, obtained by looking at the fragment covered by a selector term. We introduce an algebraic semantics for these logics and prove algebraic completeness. These logics are then related to translations , through the introduction of a number of classes of translations involving selector terms, which are noted to be ubiquitous in algebraic logic. In this setting, we also introduce a generalized Blok–Esakia theory, which can be developed for special classes of translations. We conclude by showing some systematic connections between the theory of polyatomic logics and the general Blok–Esakia theory for a wide class of interesting translations. [ABSTRACT FROM AUTHOR]

The present paper attempts to provide an exact truthmaker semantical analysis of modalized propositions. According to the present proposal, an exact truthmaker for "Necessarily P" is a state that bans every exact truthmaker for "Not P", and an exact truthmaker for "Possibly P" is a state that allows an exact truthmaker for P. Based on this proposal, a formal semantics will be developed; and the soundness and completeness results for a well-known family of the systems of normal modal propositional logic will be established. It shall be seen that the present analysis offers an exactification of the standard Kripke semantics in the sense that it analyzes the accessibility relation between possible worlds in terms of the banning and allowing relations between the constituent states, and thereby gives an account of "truth at a possible world" in terms of exact truthmaking. [ABSTRACT FROM AUTHOR]

Bilateral proof systems, which provide rules for both affirming and denying sentences, have been prominent in the development of proof-theoretic semantics for classical logic in recent years. However, such systems provide a substantial amount of freedom in the formulation of the rules, and, as a result, a number of different sets of rules have been put forward as definitive of the meanings of the classical connectives. In this paper, I argue that a single general schema for bilateral proof rules has a reasonable claim to inferentially articulating the core meaning of all of the classical connectives. I propose this schema in the context of a bilateral sequent calculus in which each connective is given exactly two rules: a rule for affirmation and a rule for denial. Positive and negative rules for all of the classical connectives are given by a single rule schema, harmony between these positive and negative rules is established at the schematic level by a pair of elimination theorems, and the truth-conditions for all of the classical connectives are read off at once from the schema itself. [ABSTRACT FROM AUTHOR]

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic logical matrices. Our constructions preserve finite-valuedness in the context of multiple-conclusion logics, whereas, unsurprisingly, it may be lost in the context of single-conclusion logics. Besides illustrating our constructions over a wide range of examples, we also develop concrete applications of our semantic characterizations, namely regarding the semantics of strengthening a given many-valued logic with additional axioms, the study of conditions under which a given logic may be seen as a combination of simpler syntactically defined fragments whose calculi can be obtained independently and put together to form a calculus for the whole logic, and also general conditions for decidability to be preserved by the combination mechanism. [ABSTRACT FROM AUTHOR]

After summarizing linguistic evidence against the thesis that actuality terms are indexical, I examine conceptual and epistemological arguments offered in favor of an indexical analysis. I argue that an indexical semantics provides no explanation of how we know what is actually the case, and no grounds for postulating a contingent a priori. Truth in every context, or in every model, does not imply knowledge of the fact a sentence expresses nor how we know it if we do. Moreover, descriptive analyses also predict that 'I exist in the actual world' and instances of 'p ≡ Actually p' are true in every context. [ABSTRACT FROM AUTHOR]

Standard unary modal logic and binary modal logic, i.e. modal logic with one binary operator, are shown to be definitional extensions of one another when an additional axiom |$U$| is added to the basic axiomatization of the binary side. This is a strengthening of our previous results. It follows that all unary modal logics extending Classical Modal Logic, in other words all unary modal logics with a neighborhood semantics, can equivalently be seen as binary modal logics. This in particular applies to standard modal logics, which can be given simple natural axiomatizations in binary form. We illustrate this in the logic K. We call such logics binary expansions of the unary modal logics. There are many more such binary expansions than the ones given by the axiom |$U$|⁠. We initiate an investigation of the properties of these expansions and in particular of the maximal binary expansions of a logic. Our results directly imply that all sub- and superintuitionistic logics with a standard modal companion also have binary modal companions. The latter also applies to the weak subintuitionistic logic WF of our previous papers. This logic doesn't seem to have a unary modal companion. [ABSTRACT FROM AUTHOR]

This article presents an overview of modal logic with semantics based on structures inherited from rough set theory. [ABSTRACT FROM AUTHOR]

Simultaneous interpreting represents a challenge for interpreters working between typologically distinct languages, like the English-Arabic language pair. The present study is conducted to explore transfers in passive voice verbs between English as the source language and Arabic as the target language in a corpus of an interpreted English speech and its corresponding Arabic counterpart. A mixed qualitative and quantitative approach is adopted in the present study to identify recurrences of passive voice verbs and to explore the ways of rendering them into Arabic. Translation shifts are identified according to Catford’s (1965) approach. The findings of the present study reveal that nearly half of the passive voice verbs found in the source text are rendered using active voice verbs in the target text. The findings also reveal that there are four other ways of rendering passive voice verbs, including using a noun phrase, omitting a part of a sentence or a sentence as a whole, using a noun, or maintaining the passive voice form of the source verb in the target sentence. The present study contributes to promoting practices that enrich the field of English-Arabic simultaneous interpreting. It also contributes to enriching the research domain with its findings that hold special significance as the passive voice verbs constitute a divergence point between the two languages. [ABSTRACT FROM AUTHOR]

In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analog of one of the most studied problems in parameterized complexity, the notion of weighted Fagin-definability, which is formulated in terms of satisfaction of first-order formulas with free relation variables. We focus on the parameterized complexity of weighted team definability for a fixed formula $\varphi$ of central team-based logics. Given a first-order structure $\mathcal{A}$ and the parameter value $k\in \mathbb N$ as input, the question is to determine whether $\mathcal{A},T\models \varphi$ for some team T of size k. We show several results on the complexity of this problem for dependence, independence, and inclusion logic formulas. Moreover, we also relate the complexity of weighted team definability to the complexity classes in the well-known W-hierarchy as well as paraNP. [ABSTRACT FROM AUTHOR]

We introduce three measures of complexity for families of sets. Each of the three measures, which we call dimensions, is defined in terms of the minimal number of convex subfamilies that are needed for covering the given family. For upper dimension, the subfamilies are required to contain a unique maximal set, for dual upper dimension a unique minimal set, and for cylindrical dimension both a unique maximal and a unique minimal set. In addition to considering dimensions of particular families of sets, we study the behavior of dimensions under operators that map families of sets to new families of sets. We identify natural sufficient criteria for such operators to preserve the growth class of the dimensions. We apply the theory of our dimensions for proving new hierarchy results for logics with team semantics. To this end we associate each atom with a natural notion or arity. First, we show that the standard logical operators preserve the growth classes of the families arising from the semantics of formulas in such logics. Second, we show that the upper dimension of $k+1$ -ary dependence, inclusion, independence, anonymity, and exclusion atoms is in a strictly higher growth class than that of any k -ary atoms, whence the $k+1$ -ary atoms are not definable in terms of any atoms of smaller arity. [ABSTRACT FROM AUTHOR]

The aim of this paper is to study a particular family of non-deterministic semantics for modal logics that has eight truth-values. These eight-valued semantics can be traced back to Omori and Skurt (2016), where a particular member of this family was used to characterize the normal modal logic K. The truth-values in these semantics convey information about a proposition's truth/falsity, whether the proposition is necessary/not necessary, and whether it is possible/not possible. Each of these triples is represented by a unique value. In this paper we will study which modal logics can be obtained by changing the interpretation of the □ modality, assuming that the interpretation of other connectives stays constant. We will show what axioms are responsible for a particular interpretations of □ . Furthermore, we will study subsets of these axioms. We show that some of the combinations of the axioms are equivalent to well-known modal axioms. We apply the level-valuation technique to all of the systems to regain the closure under the rule of necessitation. We also point out that some of the resulting logics are not sublogics of S5 and comment briefly on the corresponding frame conditions that are forced by these axioms. Ultimately, we sketch a proof of meta-completeness for all of these systems. [ABSTRACT FROM AUTHOR]

Inverse relations, or 'trade-off effects', are a common outcome of interlanguage development: a learner may increase performance in one linguistic domain while simultaneously decreasing performance in another. In this study, we investigate the relationships between one aspect of fluency (pause usage) and two aspects of syntactic complexity (utterance length and subordination) in relation to the location of pauses (between-clause or within-clause) in second-language (L2) oral narratives. The longitudinal analysis is based on monologic data produced by 16 English-speaking L2 learners of Spanish who participated in a seven-week study-abroad program in Spain. Overall, the learners decreased their silent-pause rate over the course of the program while concurrently increasing their number of syntactically complex clauses. Notably, the data suggest a systematic trade-off between pausing and complexity: the learners consistently produced more pauses (i.e. decreased fluency performance) during the elocution of the most complex clauses involving clausal subordination (i.e. increased complexity performance) in comparison to utterances lacking such subordination. We contextualize the findings within models of oral production and discuss how this research generates new insight into the processing factors that modulate pause usage in L2 speech. [ABSTRACT FROM AUTHOR]

This study investigates for the first time the comprehension of rhetorical questions (RhQs) in bilingual children. RhQs are non-canonical questions, as they are not used to request information, but to express the speaker's belief that the answer is already obvious. This special pragmatic meaning often arises by means of specific prosodic and lexical-syntactic cues. Being childhood learners, children have to acquire the concept of rhetoricity, but being bilinguals, they further need to acquire the different cues marking RhQs in their two languages. We tested 85 bilingual children (aged 6–9 years) with Italian as heritage language (HL) and German as majority language (ML) in both of their languages, using a forced-choice comprehension task. Our results show that RhQ comprehension improves with age in both languages. Bilingual children are able to exploit prosodic and syntactic cues to comprehend RhQs in their ML and HL with a slight advantage in the ML. This advantage could be either an effect of the cues used in the experiments in the two languages or of a higher proficiency in the ML. In addition, our results point to a later acquisition of prosodic rhetorical cues, which has implications for bilingual acquisition of non-canonicity in general. [ABSTRACT FROM AUTHOR]

It remains an open question whether second language (L2) learners can process linguistic properties at the syntax–discourse interface. This study examines this issue in the context of the L2 processing of Korean dative sentences under different information structure requirements. Given that discourse constraints associated with information structure tend to manifest more strongly in noncanonical than in canonical structures, we tested whether L2 learners of Korean show sensitivity to such constraints during online processing. In a story-continuation task, both native and nonnative speaker groups showed a strong preference for producing canonical dative patterns, indicating their comparable knowledge of the canonical status of Korean dative sentences. In a self-paced reading task, both groups spent longer reading times when the word order of dative sentences did not follow given–new information structure, but only for the noncanonical and not the canonical structure. These results suggest that L2 processing of dative structures at the syntax–discourse interface relies on the same parsing architecture that guides native-speaker processing. [ABSTRACT FROM AUTHOR]

This paper presents a concrete and a symbolic rewriting logic semantics for parametric time Petri nets with inhibitor arcs (PITPNs), a flexible model of timed systems where parameters are allowed in firing bounds. We prove that our semantics is bisimilar to the "standard" semantics of PITPNs. This allows us to use the rewriting logic tool Maude, combined with SMT solving, to provide sound and complete formal analyses for PITPNs. We develop and implement a new general folding approach for symbolic reachability, so that Maude-with-SMT reachability analysis terminates whenever the parametric state-class graph of the PITPN is finite. Our work opens up the possibility of using the many formal analysis capabilities of Maude—including full LTL model checking, analysis with user-defined execution strategies, and even statistical model checking—for such nets. We illustrate this by explaining how almost all formal analysis and parameter synthesis methods supported by the state-of-the-art PITPN tool Roméo can be performed using Maude with SMT. In addition, we also support analysis and parameter synthesis from parametric initial markings, as well as full LTL model checking and analysis with user-defined execution strategies. Experiments show that our methods outperform Roméo in many cases. [ABSTRACT FROM AUTHOR]

The neural correlates of sentence production are typically studied using task paradigms that differ considerably from the experience of speaking outside of an experimental setting. In this fMRI study, we aimed to gain a better understanding of syntactic processing in spontaneous production versus naturalistic comprehension in three regions of interest (BA44, BA45, and left posterior middle temporal gyrus). A group of participants (n = 16) was asked to speak about the events of an episode of a TV series in the scanner. Another group of participants (n = 36) listened to the spoken recall of a participant from the first group. To model syntactic processing, we extracted word-by-word metrics of phrase-structure building with a top--down and a bottom--up parser that make different hypotheses about the timing of structure building. While the top--down parser anticipates syntactic structure, sometimes before it is obvious to the listener, the bottom--up parser builds syntactic structure in an integratory way after all of the evidence has been presented. In comprehension, neural activity was found to be better modeled by the bottom--up parser, while in production, it was better modeled by the top--down parser. We additionally modeled structure building in production with two strategies that were developed here to make different predictions about the incrementality of structure building during speaking. We found evidence for highly incremental and anticipatory structure building in production, which was confirmed by a converging analysis of the pausing patterns in speech. Overall, this study shows the feasibility of studying the neural dynamics of spontaneous language production. [ABSTRACT FROM AUTHOR]

This paper puts forth a class of algebraic structures, relativized Boolean algebras (RBAs), that provide semantics for propositional logic in which truth/validity is only defined relative to a local domain. In particular, the join of an event and its complement need not be the top element. Nonetheless, behavior is locally governed by the laws of propositional logic. By further endowing these structures with operators—akin to the theory of modal Algebras—RBAs serve as models of modal logics in which truth is relative. In particular, modal RBAs provide semantics for various well-known awareness logics and an alternative view of possibility semantics. [ABSTRACT FROM AUTHOR]

Every individual has an idiosyncratic way of feeling, thinking and behaving, which is relatively stable across time and situations. Usually known as Personality, today this phenomenon is recognized in many species, including arthropods, fish, avian or mammals. From an evolutionary perspective, research has shown that personality differences are manifest in distinctive forms of dealing with selective pressures, with consequences for fitness. Despite these facts, the study of personality in animals other than humans is relatively new. Only two decades ago, consistent behavioral individual differences were considered 'noise' around an optimal strategy for behavioral ecologists. Also, psychologists were not interested in animal personality as a consequence of the fear of anthropomorphization and the erroneous belief that humans are unique in nature. Fortunately, this misconception seems already overcome but there are still conceptual issues preventing a unified concept of personality. Throughout this review, we first explore the etymological origins of personality and other terminological issues. We further revise the historical course of the study of personality in humans and other animals, from the perspectives of Psychology and Behavioral Ecology, on the basis of the most used approach, the trait theory. We present the study of nonhuman primates as a paradigmatic example in between both frameworks. Finally, we discuss about the necessity of a unified science of personality. [ABSTRACT FROM AUTHOR]

In this paper we deepen some aspects of the statistical approach to relevance by providing logics for the syntactical treatment of probabilistic relevance relations. Specifically, we define conservative expansions of Classical Logic endowed with a ternary connective → indeed, a constrained material implication -- whose intuitive reading is "x materially implies y and it is relevant to y under the evidence z". In turn, this ensures the definability of a formula in three-variables R(x, z, y) which is the representative of relevance in the object language. We outline the algebraic semantics of such logics, and we apply the acquired machinery to investigate some termdefined weakly connexive implications with some intuitive appeal. As a consequence, a further motivation of (weakly) connexive principles in terms of relevance and background assumptions obtains. [ABSTRACT FROM AUTHOR]

This paper analyzes the core vocabulary of English computer lexis, examining the criteria for identifying central terms and describing their structure and characteristics. The core units represent the most relevant concepts in computer terminology, characterized by high frequency, ambiguity, stylistic neutrality and significant word-formation potential. The study distinguishes “first-level core units” like “user”, “computer” and “internet” that denote the most important notions; “second-level core units” like “smart” and “digital” that originated as synonyms but became independent; and “core elements” like cyber, tele and e- that started as abbreviations. Core units generate numerous morphological and syntactic innovations, often expanding or narrowing in meaning. The core lexeme “electronic” is especially productive, forming phrases representing computer trends and systems. Core elements undergo lexicalization into independent prefixes and word-forming components. While artificial intelligence is currently popular, related linguistic innovation remains limited. The core vocabulary has a complex structure with central concepts spawning many new terms through derivation and compounding. The paper examines the phenomena of synonymous attraction, functional homonymy in core elements, and the dualistic nature of computer lexis development. It provides a systematic analysis of the core English computer terminology and its word-formation capabilities. [ABSTRACT FROM AUTHOR]

The well-known algebraic semantics and topological semantics for intuitionistic logic ( $ \mathsf {Int} $ Int ) is here extended to Wansing's bi-intuitionistic logic ( $ \mathsf {{{2Int}}} $ 2 Int ). The logic $ \mathsf {{{2Int}}} $ 2 Int is also characterised by a quasi-twist structure semantics, which leads to an alternative topological characterisation of $ \mathsf {{{2Int}}} $ 2 Int . Later, notions of Fregean negation and of unilateralisation are proposed. The logic $ \mathsf {{{2Int}}} $ 2 Int is extended with a 'Fregean negation' connective $ \mathop {\sim } $ ∼ , obtaining $ \mathsf {{{2Int^{\mathop {\sim }}}}} $ 2 In t ∼ , and it is showed that the logic $ \mathsf {{{N4^{\star }}}} $ N 4 ⋆ (an extension of Nelson's paraconsistent logic) results to be the unilateralisation of $ \mathsf {{{2Int^{\mathop {\sim }}}}} $ 2 In t ∼ via $ \mathop {\sim } $ ∼ . The logic $ \mathsf {{{2Int^{\mathop {\sim }}}}} $ 2 In t ∼ is also characterised by a Kripke-style semantics, a twist structure semantics and a topological semantics. [ABSTRACT FROM AUTHOR]

One of the basic aspects of information flow control in applications is a security policy language. This language should allow one to define security policies for evaluation of environment elements in coherence with higher-level access control rules. Hence, the language is expected to be flexible because there may be different access control paradigms (mandatory, role-based, etc.) implemented at the system level. The application may also have its own specific restrictions. Finally, it is also desirable that the language support declassification (controlled release of information) during computations. Paralocks is one of such languages. This research is devoted to the logical semantics of a modified version of Paralocks implemented in TLA+. Paralocks represents a language basis for the PLIF information flow control platform, which is developed with author's participation for the analysis of PL/SQL program blocks. It includes proofs of the partial order and lattice defined on a set of security policy expressions. [ABSTRACT FROM AUTHOR]

Background: Studies of syntactic comprehension and reading comprehension use a wide range of syntactic comprehension tests that vary considerably in format. The goal of this study was to examine to which extent different formats of syntactic comprehension tests measure the same construct. Methods: Sixty‐nine Grade 4 students completed multiple tests of decoding, vocabulary, fluid‐reasoning skill, reading comprehension and three tests of syntactic comprehension: the TROG‐2, a sentence repetition test and a whodunnit test. Results: There was limited shared variance between the syntactic comprehension tests, indicating that they only partially tapped into the same construct. Furthermore, the TROG‐2 was more highly correlated with fluid‐reasoning skill than the other syntax tests. Finally, the TROG‐2 and the whodunnit test explained additional variance in reading comprehension after controls, while sentence repetition did not. Conclusions: There are important differences between syntactic comprehension tests. This has consequences both for the interpretation of previous studies of syntactic comprehension and reading comprehension and for the design of future studies as the choice of syntactic comprehension measure may directly influence the results of the study. Highlights: What is already known about this topicPrevious studies show that different formats of sentence comprehension tests may measure different skills, but little is known about which specific skills different formats tap into. What this paper addsSyntactic comprehension tests tap into a construct that is partially separate from vocabulary and fluid‐reasoning skill.The TROG‐2 and the whodunnit test both capture variation in reading comprehension, but the TROG‐2 is highly correlated with fluid‐reasoning skill. Implications for theory, policy or practiceThere is some support for the idea that syntactic comprehension constitutes a source of individual differences in reading comprehension, indicating that some children have difficulties understanding what they read due to poor syntactic comprehension.Researchers who want to isolate the syntactic comprehension skills needed for reading comprehension from other language skills should opt for syntactic comprehension tests in the 'whodunnit' format or the TROG‐2 format rather than sentence repetition tests.Tests in the TROG‐2 format are dependent on fluid‐reasoning skill and are not appropriate for studies that need to isolate syntactic comprehension from fluid‐reasoning skill. [ABSTRACT FROM AUTHOR]

We consider products of modal logics in topological semantics and prove that the topological product of S4.1 and S4 is the fusion of logics S4.1 and S4 plus one extra asiom. This is an example of a topological product of logics that is greater than the fusion but less than the semiproduct of the corresponding logics. We also show that this product is decidable. [ABSTRACT FROM AUTHOR]