Search results for " logic"
showing 10 items of 1720 documents
On the decision problem for the guarded fragment with transitivity
2002
The guarded fragment with transitive guards, [GF+TG], is an extension of GF in which certain relations are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable. This answers the question posed in (Ganzinger et al., 1999). Moreover, we show that the problem is 2EXPTIME-complete. This result is optimal since the satisfiability problem for GF is 2EXPTIME-complete (Gradel, 1999). We also show that the satisfiability problem for two-variable [GF+TG] is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satisfiability pr…
On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
2005
We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.
Browder's theorems through localized SVEP
2005
A bounded linear operator T ∈ L(X) on aBanach space X is said to satisfy “Browder’s theorem” if the Browder spectrum coincides with the Weyl spectrum. T ∈ L(X) is said to satisfy “a-Browder’s theorem” if the upper semi-Browder spectrum coincides with the approximate point Weyl spectrum. In this note we give several characterizations of operators satisfying these theorems. Most of these characterizations are obtained by using a localized version of the single-valued extension property of T. In the last part we shall give some characterizations of operators for which “Weyl’s theorem” holds.
A generalization of Sardinas and Patterson's algorithm to z-codes
1993
Abstract This paper concerns the framework of z-codes theory. The main contribution consists in an extension of the algorithm of Sardinas and Patterson for deciding whether a finite set of words X is a z-code. To improve the efficiency of this test we have found a tight upper bound on the length of the shortest words that might have a double z-factorization over X. Some remarks on the complexity of the algorithm are also given. Moreover, a slight modification of this algorithm allows us to compute the z-deciphering delay of X.
Znawca języka czy człowiek komunikujący się? O strukturze kompetencji językowo-komunikacyjnej ucznia klas IV–VI szkoły podstawowej wpisanej w podstaw…
2019
The article aims to answer two questions: how the language instruction framework was inscribed into the 2017/2018 Polish language curriculum and what image of the linguistic and communicative competence results from this document. The research method is based on the assumption that these two questions can be answered by analysing the cognitive operators used in the description of specific requirements. The article analyses the operators found in the ‘language instruction’ section of the curriculum. Within the linguistic and communicative competence, the document distinguishes among metalinguistic, analytical, linguistic (including normative and grammar-lexical competences) and communicative…
Some Remarks on the Concept of Toleration
1997
The paper contains a conceptual analysis of “act of toleration” and the property of “being tolerant”. Being tolerant is understood as a dispositional property of persons manifested in what the author calls the “circumstances of toleration”. The main circumstances distinguished are: a tendency to prohibit a certain behaviour and the competence to determine the deontic status of the behaviour in question. An act of toleration, then, consists in not prohibiting (or cancelling the prohibition of) that behaviour. It is argued that this requires the existence of two different normative systems, the “basic system”, and the “justifying system”. Acts of toleration must be based on reasons coming fro…
Sylow permutable subnormal subgroups of finite groups
2002
[EN] An extension of the well-known Frobenius criterion of p-nilpotence in groups with modular Sylow p-subgroups is proved in the paper. This result is useful to get information about the classes of groups in which every subnormal subgroup is permutable and Sylow permutable.
Comment on: A critical analysis of the internal logic in the Life-Space Assessment (LSA) composite score and suggested solutions
2016
Background:An individual’s ability to live independently is commonly measured in health research interested in identifying risk factors associated with disablement processes. In order to inform clinical practice, population research has attempted to identify the contraction of “lived-space” by using various survey instruments.Problem:Studies assessing habitual movements over the environment with the Life-Space Assessment (LSA) survey instrument should carefully consider how the LSA Composite Score (LSA-CS) is computed. Until now, no publication has carefully delineated the assumptions guiding the internal logic used in the computation of the LSA-CS.Core argument:Because the internal logic o…
Creativity in Conceptual Spaces
2014
The main aim of this paper is contributing to what in the last few years has been known as computational creativity. This will be done by showing the relevance of a particular mathematical representation of G"ardenfors's conceptual spaces to the problem of modelling a phenomenon which plays a central role in producing novel and fruitful representations of perceptual patterns: analogy.
Modelling the Effects of Internal Textures on Symmetry Detection Using Fuzzy Operators
2009
Symmetry is a crucial dimension which aids the visual system, human as well as artificial, to organize its environment and to recognize forms and objects. In humans, detection of symmetry, especially bilateral and rotational, is considered to be a primary factor for discovering and interacting with the surrounding environment. Rotational symmetry detecting can be affected by less-known factors, such as the stimulus internal texture. This paper explores how fuzzy operators can be usefully employed in modeling the effects of the internal texture on symmetry detection. To this aim, we selected two symmetry detection algorithms, based on different computational models, and compared their output…