scholarly journals A minimal degree which collapses ω1

1984 ◽  
Vol 49 (1) ◽  
pp. 298-300 ◽  
Author(s):  
Tim Carlson ◽  
Kenneth Kunen ◽  
Arnold W. Miller

AbstractWe consider a well-known partial order of Prikry for producing a collapsing function of minimal degree. Assuming MA + ¬CH, every new real constructs the collapsing map.

2019 ◽  
Vol 7 (1) ◽  
pp. 424-430
Author(s):  
A. George Louis Raja ◽  
F. Sagayaraj Francis ◽  
P. Sugumar
Keyword(s):  

2002 ◽  
Vol 25 (3) ◽  
pp. 336-337 ◽  
Author(s):  
Zoltan Dienes ◽  
Josef Perner

We consider Perruchet & Vinter's (P&V's) central claim that all mental representations are conscious. P&V require some way of fixing their meaning of representation to avoid the claim becoming either obviously false or unfalsifiable. We use the framework of Dienes and Perner (1999) to provide a well-specified possible version of the claim, in which all representations of a minimal degree of explicitness are postulated to be conscious.


Author(s):  
Heather M Russell ◽  
Julianna Tymoczko

Abstract Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link diagrams in terms of webs, producing quantum invariants like the well-known Jones polynomial. One important question in representation theory is to identify the relationships between different bases; coefficients in the change-of-basis matrix often describe combinatorial, algebraic, or geometric quantities (e.g., Kazhdan–Lusztig polynomials). By ”flattening” the braiding maps, webs can also be viewed as the basis elements of a symmetric group representation. In this paper, we define two new combinatorial structures for webs: band diagrams and their one-dimensional projections, shadows, which measure depths of regions inside the web. As an application, we resolve an open conjecture that the change of basis between the so-called Specht basis and web basis of this symmetric group representation is unitriangular for $\mathfrak{sl}_3$-webs ([ 33] and [ 29].) We do this using band diagrams and shadows to construct a new partial order on webs that is a refinement of the usual partial order. In fact, we prove that for $\mathfrak{sl}_2$-webs, our new partial order coincides with the tableau partial order on webs studied by the authors and others [ 12, 17, 29, 33]. We also prove that though the new partial order for $\mathfrak{sl}_3$-webs is a refinement of the previously studied tableau order, the two partial orders do not agree for $\mathfrak{sl}_3$.


2015 ◽  
Vol 50 (6) ◽  
pp. 250-259 ◽  
Author(s):  
Naling Zhang ◽  
Markus Kusano ◽  
Chao Wang

2021 ◽  
Vol 82 (2) ◽  
Author(s):  
Robin Hirsch ◽  
Jaš Šemrl

AbstractThe motivation for using demonic calculus for binary relations stems from the behaviour of demonic turing machines, when modelled relationally. Relational composition (; ) models sequential runs of two programs and demonic refinement ($$\sqsubseteq $$ ⊑ ) arises from the partial order given by modeling demonic choice ($$\sqcup $$ ⊔ ) of programs (see below for the formal relational definitions). We prove that the class $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) of abstract $$(\le , \circ )$$ ( ≤ , ∘ ) structures isomorphic to a set of binary relations ordered by demonic refinement with composition cannot be axiomatised by any finite set of first-order $$(\le , \circ )$$ ( ≤ , ∘ ) formulas. We provide a fairly simple, infinite, recursive axiomatisation that defines $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) . We prove that a finite representable $$(\le , \circ )$$ ( ≤ , ∘ ) structure has a representation over a finite base. This appears to be the first example of a signature for binary relations with composition where the representation class is non-finitely axiomatisable, but where the finite representation property holds for finite structures.


2020 ◽  
Vol 26 (3-4) ◽  
pp. 268-286
Author(s):  
YONG CHENG

AbstractIn this paper, we examine the limit of applicability of Gödel’s first incompleteness theorem ($\textsf {G1}$ for short). We first define the notion “$\textsf {G1}$ holds for the theory $T$”. This paper is motivated by the following question: can we find a theory with a minimal degree of interpretation for which $\textsf {G1}$ holds. To approach this question, we first examine the following question: is there a theory T such that Robinson’s $\mathbf {R}$ interprets T but T does not interpret $\mathbf {R}$ (i.e., T is weaker than $\mathbf {R}$ w.r.t. interpretation) and $\textsf {G1}$ holds for T? In this paper, we show that there are many such theories based on Jeřábek’s work using some model theory. We prove that for each recursively inseparable pair $\langle A,B\rangle $, we can construct a r.e. theory $U_{\langle A,B\rangle }$ such that $U_{\langle A,B\rangle }$ is weaker than $\mathbf {R}$ w.r.t. interpretation and $\textsf {G1}$ holds for $U_{\langle A,B\rangle }$. As a corollary, we answer a question from Albert Visser. Moreover, we prove that for any Turing degree $\mathbf {0}< \mathbf {d}<\mathbf {0}^{\prime }$, there is a theory T with Turing degree $\mathbf {d}$ such that $\textsf {G1}$ holds for T and T is weaker than $\mathbf {R}$ w.r.t. Turing reducibility. As a corollary, based on Shoenfield’s work using some recursion theory, we show that there is no theory with a minimal degree of Turing reducibility for which $\textsf {G1}$ holds.


1993 ◽  
Vol 19 (3-4) ◽  
pp. 403-416
Author(s):  
David Murphy

The purpose of this paper is to present a real-timed concurrency theory in the noninterleaving tradition. The theory is based on the occurrences of actions; each occurrence or event has a start and a finish. Causality is modelled by assigning a strict partial order to these starts and finishes, while timing is modelled by giving them reals. The theory is presented in some detail. All of the traditional notions found in concurrency theories (such as conflict, confusion, liveness, and so on) are found to be expressible. Four notions of causality arise naturally from the model, leading to notions of securing. Three of the notions give rise to underlying event structures, demonstrating that our model generalises Winskel’s. Infinite structures are then analysed: a poset of finite structures is defined and suitably completed to give one containing infinite structures. These infinite structures are characterised as just those arising as limits of finite ones. Our technique here, which relies on the structure of time, is of independent interest.


2017 ◽  
Vol 16 (2) ◽  
pp. 1-34 ◽  
Author(s):  
Béatrice Bérard ◽  
Loïc Hélouët ◽  
John Mullins
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document