Results 151 to 160 of about 3,064 (192)
Some of the next articles are maybe not open access.
Folia Phoniatrica et Logopaedica, 2009
In classic generative grammar a distinction is drawn between linguistic ‘competence’ and linguistic ‘performance’, the former referring to linguistic knowledge, the latter to how linguistic knowledge is used. However, this controversial differentiation obscures the additional dichotomy between linguistic knowledge for production and linguistic ...
openaire +2 more sources
In classic generative grammar a distinction is drawn between linguistic ‘competence’ and linguistic ‘performance’, the former referring to linguistic knowledge, the latter to how linguistic knowledge is used. However, this controversial differentiation obscures the additional dichotomy between linguistic knowledge for production and linguistic ...
openaire +2 more sources
Unforgettable Forgetful Determinacy
Journal of Logic and Computation, 1994Summary: This paper presents a relatively compact yet complete proof of the Forgetful Determinacy Theorem (FDT) of Yuri Gurevich and Leo Harrington. The original motivation for this theorem was to provide a simpler proof of a powerful decidability result by Michael Rabin.
openaire +2 more sources
Moment Determinacy Versus q-moment Determinacy of Probability Distributions
Results in Mathematics, 2021Let $A$ be the class of probability distributions possessing finite moments of all orders and support on $]0, +\infty[$. Definition. Let $P_{X}$ be a probability distribution having a $q$-density $f_{q}$ and possessing finite $q$-moments of all orders.
Sofiya Ostrovska, Mehmet Turan
openaire +2 more sources
Bulletin of Symbolic Logic, 1995
In this paper I shall present a method for proving determinacy from large cardinals which, in many cases, seems to yield optimal results. One of the main applications extends theorems of Martin, Steel and Woodin about determinacy within the projective hierarchy.
openaire +1 more source
In this paper I shall present a method for proving determinacy from large cardinals which, in many cases, seems to yield optimal results. One of the main applications extends theorems of Martin, Steel and Woodin about determinacy within the projective hierarchy.
openaire +1 more source
Stratifications and Finite Determinacy
Proceedings of the London Mathematical Society, 1999Stratification theory came into being due to R. Thom and H. Whitney in the study of varieties and of singularities of differentiable mappings in the mid 1960s to offer an answer to an important question: when are all the elements in a family of objects topologically equivalent?
Trotman, David J. A., Wilson, Leslie C.
openaire +1 more source
Determinacy of generalized schema
IEEE Transactions on Computers, 1992R.M. Karp and R.E. Miller's (1966) computation graphs have been widely studied because they are a useful abstraction of multiprocessor computation. A system has the determinacy property if whenever the same set of input streams are entered into the system, the resultant output is the same set of output streams.
Richard S. Stevens, David J. Kaplan
openaire +1 more source
On the determinacy of repetitive structures
Journal of the Mechanics and Physics of Solids, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guest, S. D., Hutchinson, J. W.
openaire +2 more sources
1990
Abstract If the factor which determines the compliance pull of rule texts is a matter of degree, what determines the degree to which it is present in any given instance? Or, to ask the same question another way: What observable characteristics of a norm or rule of conduct increase or decrease its legitimacy?
openaire +1 more source
Abstract If the factor which determines the compliance pull of rule texts is a matter of degree, what determines the degree to which it is present in any given instance? Or, to ask the same question another way: What observable characteristics of a norm or rule of conduct increase or decrease its legitimacy?
openaire +1 more source
The determinacy of Blackwell games
Journal of Symbolic Logic, 1998Games of infinite length and perfect information have been studied for many years. There are numerous determinacy results for these games, and there is a wide body of work on consequences of their determinacy.Except for games with very special payoff functions, games of infinite length and imperfect information have been little studied.
openaire +2 more sources
Journal of Symbolic Logic, 1985
For any A ⊂ R, the Banach game B(A) is the following infinite game on reals: Players I and II alternately play positive real numbers a1; a2, a3, a4,… such that for n > 1, an < an−1. Player I wins iff ai exists and is in A.This type of game was introduced by Banach in 1935 in the Scottish Book [15], Problem 43.
openaire +1 more source
For any A ⊂ R, the Banach game B(A) is the following infinite game on reals: Players I and II alternately play positive real numbers a1; a2, a3, a4,… such that for n > 1, an < an−1. Player I wins iff ai exists and is in A.This type of game was introduced by Banach in 1935 in the Scottish Book [15], Problem 43.
openaire +1 more source