Results 11 to 20 of about 332,887 (267)
Annals of Pure and Applied Logic, 2021 We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the Weihrauch lattice.
Vasco Brattka, Guido Gherardi
openaire +4 more sources
On the completeness of complete markets [PDF]
Economic Theory, 2007 We reconsider the allocational invariance of equilibria to different formulations of market completeness. We identify the so-far neglected assumption of sophisticated behavior as crucial to this result. The paper studies three market structures. First, the Arrow-Debreu setting is considered.
P. Jean-Jacques Herings, Kirsten Rohde
openaire +4 more sources
Completion of the Causal Completability Problem [PDF]
The British Journal for the Philosophy of Science, 2015 We give a few results concerning the notions of causal completability and causal closedness of classical probability spaces (Hofer-Szabo, Redei & Szabo [1999], Gyenis & Redei [2004]). Answering a question from Hofer-Szabo et al. [1999], we prove that any classical probability space has a causally closed extension. We also employ the notion of causal up-
Wroński, Leszek, Marczyk, Michał
openaire +2 more sources
Дискурс, 2019 Introduction. The question of the correspondence between the linguistic representation of concepts that make up the national linguistic picture of the world and the linguistic consciousness of the nation is examined on the basis of the concepts of the ...
T. N. Osintseva
doaj +1 more source
RESEARCH OF TWO APPROACHES TO DETECT NETWORK ATTACKS USING NEURAL NETWORK TECHNOLOGIES
Nauka ta progres transportu, 2020 Purpose. At the present stage, network attack detection systems based on the following neural networks are most often offered: multilayer perceptron, Kohonen network or self-organizing map and their combinations.
V. M. Pakhomova, M. S. Konnov
doaj +1 more source
Partial cut elimination for propositional discrete linear time temporal logic
Lietuvos Matematikos Rinkinys, 2010 We consider propositional discrete linear time temporal logic with future and past operators of time. For each formula ϕ of this logic, we present Gentzen-type sequent calculus Gr(ϕ) with a restricted cut rule.
Jūratė Sakalauskaitė
doaj +1 more source
Completability vs (In)completeness [PDF]
Acta Linguistica Hafniensia, 2020 In everyday conversation, no notion of “complete sentence” is required for syntactic licensing. However, so-called “fragmentary”, “incomplete”, and abandoned utterances are problematic for standard formalisms. When contextualised, such data show that (a) non-sentential utterances are adequate to underpin agent coordination, while (b) all linguistic ...
Gregoromichelaki, Eleni +8 more
openaire +3 more sources
Weakly unconditionally Cauchy series and Fibonacci sequence spaces
Journal of Inequalities and Applications, 2017 We study new sequence spaces associated to sequences in normed spaces and the band matrix F̂ defined by the Fibonacci sequence. We give some characterizations of continuous linear operators and weakly unconditionally Cauchy series by means of ...
Ramazan Kama, Bilal Altay
doaj +1 more source
Complete completion using types and weights [PDF]
ACM SIGPLAN Notices, 2013 Developing modern software typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that synthesizes and suggests valid expressions of a given type at a given program point.
Gvero, Tihomir +3 more
openaire +3 more sources
Swiss Medical Weekly, 2015 QUESTIONS UNDER STUDY: Completeness is important in cancer registration. Identifying areas to improve registry procedures might help to maximise completeness.
Matthias Schindler +6 more
doaj +1 more source