Search results for "Constructive"

Valutare la devianza costruttiva nei contesti di lavoro

2017

Il presente lavoro fornisce un contributo al tema della devianza organizzativa costruttiva, intesa come un insieme di comportamenti volontari di violazione delle norme organizzative e delle procedure di lavoro, con l’intento di rispondere efficacemente ai problemi organizzativi e finalizzati a conseguire una buona performance. Attraverso due studi indipendenti è stato proposto un adattamento italiano della scala di devianza organizzativa costruttiva (Galperin, 2012), che ha mostrato, tramite analisi esplorative e confermative, soddisfacenti risultati dal punto di vista psicometrico e della validità convergente e discriminante. Sono emerse inoltre le relazioni positive del costrutto con il p…

Stochastic homogenization: Theory and numerics

2015

In this chapter, we pursue two related goals. First, we derive a theoretical stochastic homogenization result for the stochastic forward problem introduced in the first chapter. The key ingredient to obtain this result is the use of the Feynman-Kac formula for the complete electrode model. The proof is constructive in the sense that it yields a strategy to achieve our second goal, the numerical approximation of the effective conductivity. In contrast to periodic homogenization, which is well understood, numerical homogenization of random media still poses major practical challenges. In order to cope with these challenges, we propose a new numerical method inspired by a highly efficient stoc…

The overlap algebra of regular opens

2010

Abstract Overlap algebras are complete lattices enriched with an extra primitive relation, called “overlap”. The new notion of overlap relation satisfies a set of axioms intended to capture, in a positive way, the properties which hold for two elements with non-zero infimum. For each set, its powerset is an example of overlap algebra where two subsets overlap each other when their intersection is inhabited. Moreover, atomic overlap algebras are naturally isomorphic to the powerset of the set of their atoms. Overlap algebras can be seen as particular open (or overt) locales and, from a classical point of view, they essentially coincide with complete Boolean algebras. Contrary to the latter, …

Inductive Inference with Procrastination: Back to Definitions

1999

In this paper, we reconsider the definition of procrastinating learning machines. In the original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate possibility of using arbitrary linearly ordered sets to bound mindchanges in similar way. It turns out that using certain ordered sets it is possible to define inductive inference types different from the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.

Derived sets and inductive inference

1994

The paper deals with using topological concepts in studies of the Gold paradigm of inductive inference. They are — accumulation points, derived sets of order α (α — constructive ordinal) and compactness. Identifiability of a class U of total recursive functions with a bound α on the number of mindchanges implies \(U^{(\alpha + 1)} = \not 0\). This allows to construct counter-examples — recursively enumerable classes of functions showing the proper inclusion between identification types: EXα⊂EXα+1.

Constructive proofs of representation theorems in separable Hilbert space

1964

Collection Principles in Dependent Type Theory

2002

We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of the type theoretic interpretation of CZF. Suitable logic-enriched type theories allow also the study of reinterpretations of logic. We end the paper with an application to the double-negation interpretation.

Parsimony hierarchies for inductive inference

2004

AbstractFreivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and “nearly” minimal size. i.e.. within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. Alim-computable functionis (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. Investigated is the possibility of assuaging somewhat the limitation on learning power resulting from requiring parsimonio…

Heyting-valued interpretations for Constructive Set Theory

2006

AbstractWe define and investigate Heyting-valued interpretations for Constructive Zermelo–Frankel set theory (CZF). These interpretations provide models for CZF that are analogous to Boolean-valued models for ZF and to Heyting-valued models for IZF. Heyting-valued interpretations are defined here using set-generated frames and formal topologies. As applications of Heyting-valued interpretations, we present a relative consistency result and an independence proof.

The generalised type-theoretic interpretation of constructive set theory

2006

We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-Löf type theory. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive instead of being formulated via the propositions-as-types representation. The original interpretation treated logic in Martin-Löf type theory via the propositions-as-types interpretation. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive. The primitive treatment of logic in type theories allows us to study reinterpretations of logic, such as the double-negation translation.