Spontaneous Discovery and Use of Categorical Structure

1993 ◽  
Author(s):  
John P. Clapper ◽  
Gordon H. Bower
Keyword(s):  
Categorical Structure

scholarly journals An ω-categorical structure with amenable automorphism group

2015 ◽  
Vol 61 (4-5) ◽  
pp. 307-314 ◽  
Author(s):  
Aleksander Ivanov
Keyword(s):  
Automorphism Group ◽  
Categorical Structure

scholarly journals Attention constraints and learning in categories

2020 ◽  
Author(s):  
Rahul Bhui ◽  
Peiran Jiao
Keyword(s):  
Individual Differences ◽  
Category Learning ◽  
Adaptive Response ◽  
Information Sources ◽  
Bayesian Theory ◽  
Time Constraints ◽  
Categorical Structure ◽  
Information Sampling ◽  
Bias Learning

When different stimuli belong to the same category, learning about their attributes should be guided by this categorical structure. Here, we demonstrate how an adaptive response to attention constraints can bias learning toward shared qualities and away from individual differences. In three preregistered experiments using an information sampling paradigm with mousetracking, we find that people preferentially attend to information at the category level when idiosyncratic variation is low, when time constraints are more severe, and when the category contains more members. While attention is more diffuse across all information sources than predicted by Bayesian theory, there are signs of convergence toward this optimal benchmark with experience. Our results thus indicate a novel way in which a focus on categories can be driven by rational principles.

scholarly journals Generalized Bounded Linear Logic and its Categorical Semantics

2021 ◽  
pp. 226-246
Author(s):  
Yōji Fukihara ◽  
Shin-ya Katsumata
Keyword(s):  
Linear Logic ◽  
Cut Elimination ◽  
Grading System ◽  
Bounded Linear ◽  
The Core ◽  
Categorical Structure ◽  
Categorical Semantics

AbstractWe introduce a generalization of Girard et al.’s called (and its affine variant ). It is designed to capture the core mechanism of dependency in , while it is also able to separate complexity aspects of . The main feature of is to adopt a multi-object pseudo-semiring as a grading system of the !-modality. We analyze the complexity of cut-elimination in , and give a translation from with constraints to with positivity axiom. We then introduce indexed linear exponential comonads (ILEC for short) as a categorical structure for interpreting the $${!}$$ ! -modality of . We give an elementary example of ILEC using folding product, and a technique to modify ILECs with symmetric monoidal comonads. We then consider a semantics of using the folding product on the category of assemblies of a BCI-algebra, and relate the semantics with the realizability category studied by Hofmann, Scott and Dal Lago.

scholarly journals Categories of everyday knowledge in German professional discourse

2019 ◽  
Vol 69 ◽  
pp. 00063
Author(s):  
Natalia Shnyakina ◽  
Anna Klyoster
Keyword(s):  
Scientific Knowledge ◽  
Frame Analysis ◽  
Professional Discourse ◽  
Space And Time ◽  
The World ◽  
Categorical Structure ◽  
Cognitive Action ◽  
The Subject ◽  
Subject Of Cognition ◽  
Everyday Knowledge

The study of language as a cognitive phenomenon makes it possible to identify patterns of categorical division of the world. This paper considers the issue of the characteristics of everyday knowledge categories verbalization in professional discourse. On the basis of language fragments, objectifying ideas about the cognitive situation, through frame analysis, surface realizations of significant cognitive categories are investigated, among which are the subject of cognition, the object, the cognitive action, the instrument, the result, space and time. The named semantic nodes form the categorical structure of the frame behind the language fragment. The analysis demonstrates the compatibility of everyday and scientific knowledge division by a speaker; still, it illustrates the specificity of the language expression of frame nodes within the framework of professional discourse.

ℵ0-categorical structures with arbitrarily fast growth of algebraic closure

2002 ◽  
Vol 67 (3) ◽  
pp. 897-909
Author(s):  
David M. Evans ◽  
M. E. Pantano
Keyword(s):  
Growth Rate ◽  
Automorphism Group ◽  
Finite Subset ◽  
Growth Rates ◽  
Algebraic Closure ◽  
Fast Growth ◽  
Permutation Groups ◽  
Natural Numbers ◽  
Categorical Structure ◽  
Image Position

Various results have been proved about growth rates of certain sequences of integers associated with infinite permutation groups. Most of these concern the number of orbits of the automorphism group of an ℵ0-categorical structure on the set of unordered n-subsets or on the set of n-tuples of elements of . (Recall that by the Ryll-Nardzewski Theorem, if is countable and ℵ0-categorical, the number of the orbits of its automorphism group Aut() on the set of n-tuples from is finite and equals the number of complete n-types consistent with the theory of .) The book [Ca90] is a convenient reference for these results. One of the oldest (in the realms of ‘folklore’) is that for any sequence (Kn)n∈ℕ of natural numbers there is a countable ℵ0-categorical structure such that the number of orbits of Aut() on the set of n-tuples from is greater than kn for all n.These investigations suggested the study of the growth rate of another sequence. Let be an ℵ0-categorical structure and X be a finite subset of . Let acl(X) be the algebraic closure of X, that is, the union of the finite X-definable subsets of . Equivalently, this is the union of the finite orbits on of Aut()(X), the pointwise stabiliser of X in Aut(). Define

scholarly journals Categorical structure among shared features in networks of early-learned nouns

Cognition ◽  
2009 ◽  
Vol 112 (3) ◽  
pp. 381-396 ◽  
Author(s):  
Thomas T. Hills ◽  
Mounir Maouene ◽  
Josita Maouene ◽  
Adam Sheya ◽  
Linda Smith
Keyword(s):  
Categorical Structure

A computable ℵ0-categorical structure whose theory computes true arithmetic

2010 ◽  
Vol 75 (2) ◽  
pp. 728-740 ◽  
Author(s):  
Bakhadyr Khoussainov ◽  
Antonio Montalbán
Keyword(s):  
Order Theory ◽  
First Order ◽  
First Order Theory ◽  
Categorical Structure

AbstractWe construct a computable ℵ0-categorical structure whose first order theory is computably equivalent to the true first order theory of arithmetic.

scholarly journals What does color sorting tell us about lexical color categorical structure?

2018 ◽  
Vol 18 (10) ◽  
pp. 860
Author(s):  
Delwin Lindsey ◽  
Aimee Violette ◽  
Angela Brown ◽  
Prutha Deshpande
Keyword(s):  
Categorical Structure
Sign in / Sign up

Export Citation Format

Share Document