Results 71 to 80 of about 137,153 (176)
Rigid grammars in the associative-commutative Lambek calculus are not learnable [PDF]
Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - EACL '03, 2003 In (Kanazawa, 1998) it was shown that rigid Classical Categorial Grammars are learnable (in the sense of (Gold, 1967)) from strings. Surprisingly there are recent negative results for, among others, rigid associative Lambek (L) grammars.In this paper the non-learnability of the class of rigid grammars in LP (Associative-Commutative Lambek calculus) and
openaire +2 more sources
Modular analogs of character formulas and minimal lifts of modular forms
Bulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.Abstract If f$f$ is a mod‐3 eigenform of weight 2 and level Γ0(ℓ2)$\Gamma _0(\ell ^2)$ for a prime ℓ$\ell$ such that ℓ≡−1(mod3)$\ell \equiv -1 \pmod {3}$, and ℓ$\ell$ is a vexing prime for f$f$, we show that there is no obstruction to finding a minimal lift of f$f$, but that there is an obstruction to finding a nonminimal lift.
Patrick B. Allen, Preston Wake
wiley +1 more source
A Calculus of Trust Management
, 2004 We introduce ctm, a process calculus which embodies a notion of trust for global computing systems. In ctm each principal (location) is equipped with a policy, which determines its legal behaviour, and with a protocol, which allows interactions between ...
Carbone, M., Nielsen, M., Sassone, V.
core
Localization sequences for logarithmic topological cyclic homology
Journal of Topology, Volume 19, Issue 3, September 2026.Abstract We introduce the notion of an Ek$\mathbb {E}_k$‐ring with prelogarithmic structure, define logarithmic topological Hochschild homology and logarithmic topological cyclic homology in this context, and establish localization sequences for these theories. Our approach is based on Thom R$R$‐algebras.
John Rognes +2 more
wiley +1 more source
A Calculus for Orchestration of Web Services [PDF]
, 2007 We introduce COWS (Calculus for Orchestration of Web Services), a new foundational language for SOC whose design has been influenced by WS-BPEL, the de facto standard language for orchestration of web services.
Tiezzi, F. +9 more
core +1 more source
Higher representation stability for ordered configuration spaces
Journal of Topology, Volume 19, Issue 3, September 2026.Abstract Using factorization homology with coefficients in twisted commutative algebras (TCAs), we prove two flavors of higher representation stability for the cohomology of (generalized) configuration spaces of a scheme/topological space X$X$. First, we provide an iterative procedure to study higher representation stability using actions coming from ...
Quoc P. Ho
wiley +1 more source
COWS: A Timed Service-Oriented Calculus [PDF]
, 2007 COWS (Calculus for Orchestration of Web Services) is a foundational language for Service Oriented Computing that combines in an original way a number of ingredients borrowed from well-known process calculi, e.g.
R. Pugliese +8 more
core +1 more source
Pinwheels in symplectic rational and ruled surfaces and non‐squeezing of rational homology balls
Journal of Topology, Volume 19, Issue 3, September 2026.Abstract We use almost toric fibrations and the symplectic rational blow‐up to determine when certain Lagrangian pinwheels, which we call liminal, embed in symplectic rational and ruled surfaces. The case of L2,1$L_{2,1}$‐pinwheels, namely Lagrangian RP2s$\mathbb {R}P^2{\rm s}$, answers a question of Kronheimer in the negative, exhibiting a symplectic ...
Nikolas Adaloglou, Johannes Hauber
wiley +1 more source
EXPTIME Tableaux for the Coalgebraic Mu-Calculus
, 2009 The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic.
Pattinson, Dirk +2 more
core +1 more source
A Dependently Typed Ambient Calculus
, 2003 The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to enforce elementary access control policies, expressed indirectly via ...
Cedric Lhoussaine +3 more
core +1 more source