نتایج جستجو برای: universal theories

تعداد نتایج: 217313  

1995
S. Dimopoulos

In the absence of universality the naturalness upper limits on supersymmetric particle masses increase significantly. The superpartners of the two light generations can be much heavier than the weak scale without extreme fine-tunings; they can weigh up to about 900 GeV — or even up to 5 TeV, if SU(5) universality is invoked. This supresses sparticlemediated rare processes and consequently ameli...

2008
DANIEL DUGGER

Begin with a small category C. The goal of this short note is to point out that there is such a thing as a ‘universal model category built from C’. We describe applications of this to the study of homotopy colimits, the Dwyer-Kan theory of framings, to sheaf theory, and to the homotopy theory of schemes.

1996
Patrick Doherty Witold Lukaszewicz Andrzej Szalas

We rst de ne general domain circumscription GDC and provide it with a semantics GDC subsumes existing domain circumscrip tion proposals in that it allows varying of arbitrary predicates functions or constants to maximize the minimization of the domain of a theory We then show that for the class of semi universal theories without func tion symbols that the domain circumscription of such theories...

Journal: :Annual review of psychology 1998
C R Cooper J Denner

Psychological theories and research often assume nations are culturally homogeneous and stable. But global demographic, political, and economic changes and massive immigration have sparked new scholarly and policy interest in cultural diversity and change within nations. This chapter reviews interdisciplinary advances linking culture and psychological development. These challenge and strengthen...

Journal: :Brain and language 2006
Johannes C Ziegler

It has been commonly agreed that developmental dyslexia in different languages has a common biological origin: a dysfunction of left posterior temporal brain regions dealing with phonological processes. Siok, Perfetti, Jin, and Tan (2004, Nature, 431, 71-76) challenge this biological unity theory of dyslexia: Chinese dyslexics show no deficits in posterior temporal brain regions but a functiona...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم 1375

chapter two presents three m-admissible function algebras ab, bd, and sl, to construct the universal abelian, band, and semilattice compactifications, respectively. the main results are (11.3), (12.3), and (12.4). some inclusion relationships between these function algebras and the other well-known ones, presented in section 8, are made via the devico of compactifications. chpter three is about...

2004
Spiros Cotsakis

We examine and compare the behaviour of the scalar field slice energy in different classes of theories of gravity, in particular higher-order and scalar-tensor theories. We find a universal formula for the energy and compare the resulting conservation laws with those known in general relativity. This leads to a comparison between the inflaton, the dilaton and other forms of scalar fields presen...

1993
Aleksandar KOCIĆ

We argue that theories with fundamental fermions which undergo chiral symmetry breaking have several universal features which are qualitatively different than those of theories with fundamental scalars. Several bounds on the critical indices δ and η follow. We observe that in four dimensions the logarithmic scaling violations enter into the Equation of State of scalar theories, such as λφ, and ...

2012
Claire Dross Sylvain Conchon Johannes Kanig Andrei Paskevich

SMT solvers can decide the satisfiability of ground formulas modulo a combination of built-in theories. Adding a built-in theory to a given SMT solver is a complex and time consuming task that requires internal knowledge of the solver. However, many theories (arrays [13], reachability [11]), can be easily expressed using first-order formulas. Unfortunately, since universal quantifiers are not h...

2017
Andrew Reynolds Cesare Tinelli

A synthesis conjecture asks whether there exists a structure for which some property holds universally. Traditionally, such conjectures are very challenging for automated reasoners. Syntax-guided synthesis (or SyGuS) is a recently introduced paradigm [1] where a user may provide syntactic hints to guide an automated reasoner in its search for solutions to synthesis conjectures. A number of rece...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید