Positional discriminability in linear orderings

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A positional discriminability model of linear-order judgments.

The process of judging the relative order of stimuli in a visual array was investigated in three experiments. In the basic paradigm, a linear array of six colored lines was presented briefly, and subject decided which of two target lines was the leftmost or rightmost (Experiment 1). The target lines appeared in all possible combinations of serial positions and reaction time (RT) was measured. D...

متن کامل

Low linear orderings

We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We construct a computable presentation of any low weakly η-like linear ordering with no strongly η-like interval. Also we prove that there exists a noncomputably presentable low2 weakly η-like linear ordering with no strongly η-like interval.

متن کامل

Countably Complementable Linear Orderings

We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L does not embed into B if and only if B embeds into L. We characterize the linear orderings which are countably complementable. We also show that this property is equivalent to the countable version of the finitely faith...

متن کامل

Algebraic Linear Orderings

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle...

متن کامل

Automata on Linear Orderings

We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these words. We prove that for countable scattered linear orderings, these two notions are equivalent. This result extends Kleene’s theorem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Memory & Cognition

سال: 1978

ISSN: 0090-502X,1532-5946

DOI: 10.3758/bf03197442