Modal translations in substructural logics

Substructural logics are logics obtained from a sequent formulation of intuitionistic or classical logic by rejecting some structural rules. The substructural logics considered here are linear logic, relevant logic and BCK logic. It is proved that first-order variants of these logics with an intuitionistic negation can be embedded by modal translations into S40type extensions of these logics with a classical, involutive, negation. Related embeddings via translations like the double-negation translation are also considered. Embeddings into analogues of S4 are obtained with the help of cut climination for sequent formulations of our substructural logics and their modal extensions. These results are proved for systems with equality too.     

On the Standard and Rational Completeness of some Axiomatic Extensions of the Monoidal T-norm Logic

The monoidal t-norm based logic MTL is obtained from Hájek's Basic Fuzzy logic BL by dropping the divisibility condition for the strong (or monoidal) conjunction. Recently, Jenei and Montgana have shown MTL to be standard complete, i.e. complete with respect to the class of residuated lattices in the real unit interval [0,1] defined by left-continuous t-norms and their residua. Its corresponding algebraic semantics is given by pre-linear residuated lattices. In this paper we address the issue of standard and rational completeness (rational completeness meaning completeness with respect to a class of algebras in the rational unit interval [0,1]) of some important axiomatic extensions of MTL corresponding to well-known parallel extensions of BL. Moreover, we investigate varieties of MTL algebras whose linearly ordered countable algebras embed into algebras whose lattice reduct is the real and/or the rational interval [0,1]. These embedding properties are used to investigate finite strong standard and/or rational completeness of the corresponding logics.     

On the Predicate Logic of Linear Kripke Frames and some of its Extensions

We propose a new, rather simple and short proof of Kripke-completeness for the predicate variant of Dummett's logic. Also a family of Kripke-incomplete extensions of this logic that are complete w.r.t. Kripke frames with equality (or equivalently, w.r.t. Kripke sheaves [8]), is described.     

Program Constructions that are Safe for Bisimulation

It has been known since the seventies that the formulas of modal logic are invariant for bisimulations between possible worlds models — while conversely, all bisimulation-invariant first-order formulas are modally definable. In this paper, we extend this semantic style of analysis from modal formulas to dynamic program operations. We show that the usual regular operations are safe for bisimulation, in the sense that the transition relations of their values respect any given bisimulation for their arguments. Our main result is a complete syntactic characterization of all first-order definable program operations that are safe for bisimulation. This is a semantic functional completeness result for programming, which may be contrasted with the more usual analysis in terms of computational power. The 'Safety Theorem' can be modulated in several ways. We conclude with a list of variants, extensions, and further developments.     

Extending Łukasiewicz Logics with a Modality: Algebraic Approach to Relational Semantics

This paper presents an algebraic approach of some many-valued generalizations of modal logic. The starting point is the definition of the [0, 1]-valued Kripke models, where [0, 1] denotes the well known MV-algebra. Two types of structures are used to define validity of formulas: the class of frames and the class of ? _n -valued frames. The latter structures are frames in which we specify in each world u the set (a subalgebra of ? _n ) of the allowed truth values of the formulas in u. We apply and develop algebraic tools (namely, canonical and strong canonical extensions) to generate complete modal n + 1-valued logics and we obtain many-valued counterparts of Shalqvist canonicity result.     

Generalized sample size determination formulas for experimental research with hierarchical data

Hierarchical data sets arise when the data for lower units (e.g., individuals such as students, clients, and citizens) are nested within higher units (e.g., groups such as classes, hospitals, and regions). In data collection for experimental research, estimating the required sample size beforehand is a fundamental question for obtaining sufficient statistical power and precision of the focused parameters. The present research extends previous research from Heo and Leon (2008) and Usami (2011b), by deriving closed-form formulas for determining the required sample size to test effects in experimental research with hierarchical data, and by focusing on both multisite-randomized trials (MRTs) and cluster-randomized trials (CRTs). These formulas consider both statistical power and the width of the confidence interval of a standardized effect size, on the basis of estimates from a random-intercept model for three-level data that considers both balanced and unbalanced designs. These formulas also address some important results, such as the lower bounds of the needed units at the highest levels.     

Relation Formulas for Protoalgebraic Equality Free Quasivarieties; Pałasińska’s Theorem Revisited

We provide a new proof of the following Pa?asińska's theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are ${\mathcal{Q}}$ Q -relation formulas for a protoalgebraic equality free quasivariety ${\mathcal{Q}}$ Q . They are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Having this tool in hand, we prove a finite axiomatization theorem for ${\mathcal{Q}}$ Q when it has definable principal ${\mathcal{Q}}$ Q -subrelations. This is a property obtained by carrying over the definability of principal subcongruences, invented by Baker and Wang for varieties, and which holds for finitely generated protoalgebraic relation distributive equality free quasivarieties.     

Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames

The main result is that is no effective algorithmic answer to the question:how to recognize whether arbitrary modal formula has a first-order equivalent on the class of finite frames. Besides, two known problems are solved: it is proved algorithmic undecidability of finite frame consequence between modal formulas; the difference between global and local variants of first-order definability of modal formulas on the class of transitive frames is shown.Presented byHiroakira Ono     

Reliability formulas for noncompleted or speeded tests

New formulas are developed to give lower bounds to the reliability of a test, whether or not all respondents attempt all items. The formulas apply in particular, then, to completed tests, pure speed tests, pure power tests, and any mixture of speed and power. For the case of completed tests, the formulas give the same answer as certain standard ones; for noncompleted tests the formulas give a correct answer where previous standard formulas are inappropriate. The formulas hold both in the sense of retest reliability and of parallel tests.This research was facilitated by an uncommitted grant-in-aid to the writer from the Behavioral Sciences Division of the Ford Foundation.     

Aggregate Theory Versus Set Theory

Maddy's (1990) arguments against Aggregate Theory were undermined by the shift in her position in 1997. The present paper considers Aggregate Theory in the light of this, and the recent search for `New Axioms for Mathematics'. If Set Theory is the part-whole theory of singletons, then identifying singletons with their single members collapses Set Theory into Aggregate Theory. But if singletons are not identical to their single members, then they are not extensional objects and so are not a basis for Science. Either way, the Continuum Hypothesis has no physical interest.     

翻译训练对大学生心理词汇概念间联系的影响

采用词汇联想实验,通过两项实验探讨了翻译训练对大学生心理词汇概念联结的影响。结果表明：①翻译专业大学生的母语心理词汇与二语心理词汇概念联系特性存在显著差异,相对于母语,二语的概念联系较多受语音和字形等非语义联系的影响;②翻译训练和实践可促进大学生英语心理词汇的语义联结,减弱英语词汇语音和字形等语言形式的影响;③翻译训练和实践对大学生心理词汇的主题关联联系意识的促进效应高于对其分类学意识的促进效应。     

Extension of Feldt's approach to testing homogeneity of coefficients of reliability

Limitations and extensions of Feldt's approach to testing the equality of Cronbach's alpha coefficients in independent and matched samples are discussed. In particular, this approach is used to test equality of intraclass correlation coefficients.This work was supported by the National Institute of Mental Health Specialized Research Center Grant # MH-30854.     

A Logical Account of Formal Argumentation

In the current paper, we re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able to express the (complete) extensions of an argumentation framework as models of a set of modal logic formulas that represents the argumentation framework. Using this approach, it becomes possible to define the grounded extension in terms of modal logic entailment.     

辅助变元之于命题与量化布尔公式的作用

使用辅助变元来引入定义,在知识表达中是一个流行和有力的技巧,能够得到更短、更自然的编码而无需冗长的重复。这篇论文中,我们形式地定义了辅助变元的概念,检验了其表达力并讨论了有趣的相关应用。我们把以下两者联系起来:一是,反复使用中间结果而不通过定义重复;二是,布尔函数其他表达中的相似概念。特别的,我们表明带定义的命题逻辑与具有任意输出端的布尔线路以及约束变元满足Horn性质的存在量化布尔公式(记作(?)HORN~b)具有相同的表达力。本文还考虑了定义结构的限制,以及命题定义的扩充。特别的,我们检验了正命题定义与带存在量化的正定义之间的关系(或等价地,检验了(?)HORN~b公式和约束变元未被Horn限定的存在量化的CNF公式(记作(?)CNF~*)之间的关系)。对命题定义的进一步扩充,是允许在定义中使用任意的量词,或等价地,允许布尔公式的嵌入。我们还证明了,量化CNF公式中的约束变元的表达力,是由子句中被约束部分的极小不可满足子公式或极小假子公式的结构所决定的。     

Public announcement logic with distributed knowledge: expressivity,completeness and complexity

While dynamic epistemic logics with common knowledge have been extensively studied, dynamic epistemic logics with distributed knowledge have so far received far less attention. In this paper we study extensions of public announcement logic (\(\mathcal{PAL }\)) with distributed knowledge, in particular their expressivity, axiomatisations and complexity. \(\mathcal{PAL }\) extended only with distributed knowledge is not more expressive than standard epistemic logic with distributed knowledge. Our focus is therefore on \(\mathcal{PACD }\), the result of adding both common and distributed knowledge to \(\mathcal{PAL }\), which is more expressive than each of its component logics. We introduce an axiomatisation of \(\mathcal{PACD }\), which is not surprising: it is the combination of well-known axioms. The completeness proof, however, is not trivial, and requires novel combinations and extensions of techniques for dealing with \(S5\) knowledge, distributed knowledge, common knowledge and public announcements at the same time. We furthermore show that \(\mathcal{PACD }\) is decidable, more precisely that it is \(\textsc {exptime}\)-complete. This result also carries over to \(\mathcal{S 5\mathcal CD }\) with common and distributed knowledge operators for all coalitions (and not only the grand coalition). Finally, we propose a notion of a trans-bisimulation to generalise certain results and give deeper insight into the proofs.     

Approximate Semantic Transference: A Computational Theory of Metaphors and Analogies

In this paper we start from the assumption that in a metaphor, or an analogy, some terms belonging to one domain (source domain) are used to refer to objects other than their conventional referents belonging to a possibly different domain (target domain). We describe a formalism, which is based on the First Order Predicate Calculus, for representing the knowledge structure associated with a domain and then develop a theory of Constrained Semantic Transference [CST] which allows the terms and the structural relationships of the source domain to be transferred coherently across to the target domain. We show how metaphors and analogies can be characterized in CST in such a way that many of their cognitive properties con be explained. We then propose a theory of Approximate Semantic Transference [AST] which is a computational version of CST and is derived from it by replacing the coherency requirement with approximate coherency. We show how AST can be used as a basis for designing models of cognitive processes involved in comprehending metaphors and analogies.     

A Map of Common Knowledge Logics

In order to capture the concept of common knowledge, various extensions of multi-modal epistemic logics, such as fixed-point ones and infinitary ones, have been proposed. Although we have now a good list of such proposed extensions, the relationships among them are still unclear. The purpose of this paper is to draw a map showing the relationships among them. In the propositional case, these extensions turn out to be all Kripke complete and can be comparable in a meaningful manner. F. Wolter showed that the predicate extension of the Halpern-Moses fixed-point type common knowledge logic is Kripke incomplete. However, if we go further to an infinitary extension, Kripke completeness would be recovered. Thus there is some gap in the predicate case. In drawing the map, we focus on what is happening around the gap in the predicate case. The map enables us to better understand the common knowledge logics as a whole.     

Interactions between Knowledge,Action and Commitment within Agent Dynamic Logic

This paper considers a new class of agent dynamic logics which provide a formal means of specifying and reasoning about the agents activities and informational, motivational and practical aspects of the behaviour of the agents. We present a Hilbert-style deductive system for a basic agent dynamic logic and consider a number of extensions of this logic with axiom schemata formalising interactions between knowledge and commitment (expressing an agent s awareness of her commitments), and interactions between knowledge and actions (expressing no learning and persistence of knowledge after actions). The deductive systems are proved sound and complete with respect to a Kripke-style semantics. Each of the considered logics is shown to have the small model property and therefore decidable.Presented by Ewa Orlowska     

Facilitating Communication of Ideas and Evidence to Enhance Mental Health Service Quality: Coding the Treatment Services Literature Using the Child and Adolescent Needs and Strengths-Mental Health Assessment Scales

The evidence-base services literature is continually growing, providing the field with rich and important sets of information regarding what works for treating different types of youth and families. Given this burgeoning of information, the PracticeWise Evidence-Based Services (PWEBS) Literature Database has been developed to aid in summarizing and delivering aggregated evidence-based treatment information to providers in the field. Meanwhile, the Child and Adolescent Needs and Strengths-Mental Health (CANS-MH) Scale is a youth mental health assessment tool that was developed by a separate team to assist with treatment planning. In the present study, we developed and tested a system for linking these two related ontological systems so that scientific knowledge can be more widely aggregated and made available to a wider set of audiences for enhanced mental health service delivery. Results revealed the following. First, a construct mapping comparison revealed that the CANS-MH and PWEBS ontologies share a strong core of overlapping content, particularly in the areas of Youth Behavioral/Emotional Needs, Youth Risk Behaviors, and Life Domain Functioning. Second, the CANS-MH areas were able to be used to reliably code the following components of published randomized treatment studies: (a) population sample characteristics (e.g., did the characteristics of the treatment study participant population relate to each CANS-MH area?), and (b) outcome measure targets (e.g., did the treatment study outcome measure target areas relate to each CANS-MH area?). The reliability achieved from this coding process supported the linkage between the CANS-MH areas and the PWEBS Literature Database information. Lastly, high agreement was achieved between an automated translation algorithm and the final ratings from the manual coding of published treatment studies using the CANS-MH scale. The importance of such linkages for the communication of ideas, information, and evidence across differing subfields is discussed, as well as examples of achieving enhanced quality of mental health services by linking system ontologies.     

Modellierung von Fehlkonzepten in einer algebraischen Wissensstruktur

An extension of the theory of knowledge spaces by Doignon &; Falmagne (1985) is presented that tries to account for subjects’ typical errors and wrong answers. This extension concerns two major points: The usual dichotomous item format (right/wrong) is generalized to polytomous response categories, and the theoretical structure (knowledge, skills, misconceptions) is clearly separated from the empirical structure (observable solution behavior, subject’s responses). Using examples from a set of questions about properties of simple electric circuits the general method is demonstrated. Axioms of an algebraic structure known as “information system” (Scott, 1982) are shown to provide an appropriate characterization of the theoretical domain. The structural properties of the data, on the other hand, can be derived from assumptions about the influence of knowledge and misconceptions on specific answers for a set of questions.