نتایج جستجو برای: mental model completeness scale

تعداد نتایج: 2781299  

Journal: :Psychiatry research 2010
Saioa Aspiazu Fernando Mosquera Berta Ibañez Patricia Vega Sara Barbeito Puri López Sonia Ruiz de Azúa Amaia Ugarte Eduard Vieta Ana González-Pinto

Insight impairment is common early in the course of psychosis. Most studies have focused on the relationship between insight and depression, although manic symptoms are also frequent in psychoses. The main aim of this study was to examine the relationship between insight dimensions and manic and depressive symptoms in first-episode psychosis. A group of inpatients in their first psychotic episo...

Journal: :CoRR 2017
Tobias Kappé Paul Brunet Alexandra Silva Fabio Zanasi

Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and Wehrman in 2009 as a framework to reason about concurrent programs. We prove that the semantics proposed in the original paper is the free model of CKA with bounded parallel iteration, meaning the completeness of these axioms. This result settles a conjecture of Hoare and collaborators. Moreover, it allows us to establ...

1995
John T. Baldwin

We work throughout in a finite relational language L. Our aim is to analyze in as purely a model-theoretic context as possible some recent results of Shelah et al in which 0 − 1-laws for random structures of various types are proved by a specific kind of quantifier elimination: near model completeness. In Section 2 we describe the major results of these methods ([12], [11] etc.) and some of the...

2006
Jit Biswas Felix Naumann Qiang Qiu

In this paper we present a quality model highlighting the completeness of sensor data with respect to its application. The model allows consistent handling of information loss as data propagates through a sensor network. The tradeoffs between various factors that influence completeness are quantified thereby allowing an integrated view of completeness at various levels in a system. The paper is...

Donal O’Regan, Reza Saadati, S. B. Hosseini

In this paper we define intuitionistic fuzzy metric and normedspaces. We first consider finite dimensional intuitionistic fuzzy normed spacesand prove several theorems about completeness, compactness and weak convergencein these spaces. In section 3 we define the intuitionistic fuzzy quotientnorm and study completeness and review some fundamental theorems. Finally,we consider some properties of...

The present paper introduces the notion of the complete fuzzy norm on a linear space. And, some relations between the fuzzy completeness and ordinary completeness on a linear space is considered, moreover a new form of fuzzy compact spaces, namely b-compact spaces and b-closed spaces are introduced. Some characterizations of their properties are obtained.

1998
Gavin Lowe

Model checking approaches to the analysis of security protocols have proved remarkably successful. The basic approach is to produce a model of a small system running the protocol, together with a model of the most general intruder who can interact with the protocol, and then to use a state exploration tool to search for attacks. This has led to a number of new attack upon protocols being discov...

2003
John T. Baldwin Kitty Holland

The projective plane of [2] is model complete in a language with additional constant symbols. The infinite rank bicolored field of [14] is not model complete. The finite rank bicolored fields of [4, 6] are model complete. More generally, the finite rank expansions of a strongly minimal set obtained by adding a ‘random’ unary predicate are almost strongly minimal and model complete provided the ...

Journal: :Notre Dame Journal of Formal Logic 2015
Michael C. Laskowski

We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields a new, more constructive proof that the elementary diagram of any model of a strongly minimal, trivial theory is model complete.

Journal: :Software - Concepts and Tools 1994
Timothy B. Brown Takayuki Dan Kimura

Visual programming is the specification of computational processes using diagrams and icons. Traditional computation models such as Turing machines and lambda-calculus, which are based on one-dimensional text strings, are not suitable for visual programming languages. We propose a two-dimensional computation model that requires no text. We also prove that the model is computationallhy complete,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید