A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
n-Simple theories

2005
*
Annals of Pure and Applied Logic
*

dependence relation called dividing in

doi:10.1016/j.apal.2004.06.001
fatcat:b5sszjhclfb7rpmqjd2ys2kvwi
*simple**theories*. ... That is, we are trying to answer the question of when a*simple**theory*has the property of n-dimensional amalgamation, where two-dimensional amalgamation is the Independence Theorem for*simple**theories*. ... Let T be a strongly 2-*simple**theory*. ...##
###
Simple unstable theories

1980
*
Annals of Mathematical Logic
*

We point out a class of unstable

doi:10.1016/0003-4843(80)90009-1
fatcat:cf4ukeuygbffxeick6osydcppq
*theories*which are*simple*, and develop for them an aqalog to the basic theorems on stable*theories*. ... This theorem shows in some sense the distinction between*simple*and not*simple**theories*is significant. Proot ot Theorem 4.10. ... Here we give some further characterizations and refinements with unstable*theories*in mind. Lemma 1.3. ...##
###
A simple theory for simple glass

2018
*
Science
*

GLASS TRANSITION A

doi:10.1126/science.359.6380.1115-c
fatcat:3lcf65ympffvjnifclax4pexmu
*simple**theory*for*simple*glass G lasses have many important industrial applications, yet understanding the changes that occur over the wide range of time and length scales of the glass ... This finding dramatically simplifies the*theory*that describes these fluids, which include technologically important materials such as metallic glasses. -BG Nat. Commun. 10.1038 Commun. 10. ...##
###
Theory interpretation in simple type theory
[chapter]

1994
*
Lecture Notes in Computer Science
*

Although the method is based on a nonclassical version of

doi:10.1007/3-540-58233-9_6
fatcat:ohqmwuei75cgndlzsitpw3md5e
*simple*type*theory*, it is intended as a guide for*theory*interpretation in classical*simple*type*theories*as well as in predicate logics with partial ... This paper presents a method for*theory*interpretation in a version of*simple*type*theory*, called lutins, which admits partial functions and subtypes. ... Although the method is based on a nonclassical form of*simple*type*theory*, we expect it to be useful as a guide for*theory*interpretation in classical*simple*type*theories*as well as in predicate logics ...##
###
Simple type theoryについて

1968
*
SUGAKU
*

い て 実 数 論 を 構 成 す る 方 法 は

doi:10.11429/sugaku1947.20.129
fatcat:stljvy63nvdehdakjnbpv26ey4
*simple*type*theory*の 中 で で き る か ら, Peanoの 公 理 系 が*simple*type*theory*の 中 で 無 矛 盾 か ど うか が 問 題 と な る 。 ...*Simple*type*theory*に つ い て 131 (皿)Comprehensionに つ い て の 推 論 図. (N)Extensionalityに つ い て の 推 論 図. ...##
###
Dualized Simple Type Theory

2017
*
Logical Methods in Computer Science
*

It is a

doi:10.2168/lmcs-12(3:2)2016
fatcat:lor2qixs7vhlxlimlldgasmx7m
*simple*type*theory*with perfect intuitionistic duality, and corresponds to a single-sided polarized sequent calculus. We prove DTT strongly normalizing, and prove type preservation. ... We propose a new bi-intuitionistic type*theory*called Dualized Type*Theory*(DTT). ... The Dual Calculus was invented by Wadler [36] , and is a multi-conclusion classical*simple*type*theory*based in sequent calculus instead of natural deduction. ...##
###
Oligopoly Theory Made Simple
[chapter]

2001
*
Surfing Economics
*

to model product market competition -Bertrand (price) competition, and Cournot Oligopoly made

doi:10.1007/978-1-137-04142-5_6
fatcat:iiffrv7hafduzkb22vp4jt2brq
*simple*05/07/07 ... The recent development of oligopoly*theory*is inextricably bound up with developments in abstract game*theory*. ... There are many results in game*theory*relating to the existence of Nash equilibrium. ...##
###
Theory of simple glasses
[article]

2012
*
arXiv
*
pre-print

Approximate

arXiv:1212.0390v1
fatcat:ukgexclmhvh2pnejol47joozn4
*theories*in finite dimensions The Van der Waals*theory*can be seen as a*simple*resummation of the low-density virial expansion. ... The Gaussian replica*theory*provides precise and*simple*predictions for the contact regime scaling function Z ± (x) [1, 2, 163] : Z(r) = z + C (r − σ) 1−α , (2. ...##
###
Basic simple type theory

1998
*
Science of Computer Programming
*

Another connection not pointed to is the connection to current

doi:10.1016/s0167-6423(98)00011-2
fatcat:xfszlmceb5er3ccu4hzgs5mcya
*theories*on the syntax and semantics of natural languages. ... At best, they hear about the untyped A-calculus as an equivalent formulation (to Turing machines), for computability*theory*. ... The Capabilities of Computing Machinery Apart from certain issues in complexity*theory*, the power of the classical deterministic or probabilistic computer (Turing machine) is fairly well understood: we ...##
###
Groups in simple theories
[article]

1997
*
arXiv
*
pre-print

Groups definable in

arXiv:math/9704233v1
fatcat:ga2bvvqzwjhurpnpg6u4djlkuy
*simple**theories*retain the chain conditions and decomposition properties known from stable groups, up to commensurability. ... One-based*simple*groups are finite-by-abelian-by-finite. ... In a stable*theory*, the converse holds as well; this is open in general for*simple**theories*. ...##
###
Random Simple-Homotopy Theory
[article]

2021
*
arXiv
*
pre-print

We implement an algorithm RSHT (Random

arXiv:2107.09862v2
fatcat:yzmu4ids75ch3bmz5rgicwinjq
*Simple*-Homotopy) to study the*simple*-homotopy types of simplicial complexes, with a particular focus on contractible spaces and on finding substructures in higher-dimensional ... The first author acknowledges support by NSF Grant 1855165, "Geometric combinatorics and discrete Morse*theory*". ... Our work builds on that of Whitehead, who in 1939 introduced a discrete version of homotopy*theory*, called*simple*-homotopy*theory*[Whi39] . ...##
###
Supersimple Theories
[chapter]

2000
*
Simple Theories
*

(i) For

doi:10.1007/978-94-017-3002-0_5
fatcat:clqqg5w64vfqhctaq2aj7ltb4a
*simple**theories*, dividing is equivalent to a certain apriori weaker notion, forking. For*simple**theories*we use these words interchangeably. ... In the past few years, the class of*simple**theories*, a far-reaching generalisation of the class of stable*theories*, has been intensively studied. ...##
###
Keisler's order is not simple (and simple theories may not be either)
[article]

2021
*
arXiv
*
pre-print

The

arXiv:1906.10241v4
fatcat:bijiw4npxbgdnd6i6pc5j46szq
*theories*we build are*simple*unstable with no nontrivial forking, and reflect growth rates of sequences which may be thought of as densities of certain regular pairs, in the sense of Szemer\'edi's ... The proof involves ideas from model*theory*, set*theory*, and finite combinatorics. ... Saturated models of*simple**theories*. ...##
###
The Theory of Simple Rings

1943
*
American Journal of Mathematics
*

THE

doi:10.2307/2371775
fatcat:xvsldjtn6zgwjlwjis4w6gohl4
*THEORY*OF*SIMPLE*RINGS.* By Emit ArTIN and GEorGE WHAPLES. Introduction. ... In this paper we discuss the*theory*of*simple*associative rings; for such rings we prove structure theorems which are generalizations of the well known theorems concerning commutators, automorphisms, etc ...##
###
Concurrency Makes Simple Theories Hard

2012
*
Symposium on Theoretical Aspects of Computer Science
*

products to

doi:10.4230/lipics.stacs.2012.148
dblp:conf/stacs/GollerL12
fatcat:ni2axcfk4bghdngi4ul4zourlm
*theories*of the components. ... We show that even the simplest notion of product operators (i.e. asynchronous products) suffices to increase the complexity of model checking*simple*logics like Hennessy-Milner (HM) logic and its extension ... When we consider logic model checking, the situation is not as*simple*. ...
« Previous

*Showing results 1 — 15 out of 4,076,997 results*