POWER
发表于 2025-3-28 14:34:22
http://reply.papertrans.cn/24/2338/233759/233759_41.png
FATAL
发表于 2025-3-28 19:45:20
http://reply.papertrans.cn/24/2338/233759/233759_42.png
大方不好
发表于 2025-3-29 02:24:17
https://doi.org/10.1007/978-1-4684-8050-4In the ambient logic of classical second order propositional calculus, we solve the specification problem for a family of excluded middle like tautologies. These are shown to be realized by sequential simulations of specific communication schemes for which they provide a safe typing mechanism.
expository
发表于 2025-3-29 03:30:11
Choiceless Polynomial Time Computation and the Zero-One LawThis paper is a sequel to [.], a commentary on [.], and an abridged version of a planned paper that will contain complete proofs of all the results presented here.
AMOR
发表于 2025-3-29 07:28:11
Translating Theory into Practice — Abstract State Machines within MicrosoftAs researchers in rigorous methods we are interested in the challenge of building and maintaining software systems on a massive scale. Our methods must work for real-world systems with hundreds or thousands of components that interact in complex ways.
保守
发表于 2025-3-29 12:54:10
Choiceless Polynomial Time Logic: Inability to ExpressWe prove for the logic . (the logic from the title) a sufficient condition for two models to be equivalent for any set of sentences which is “small” (certainly any finite set ), parallel to the Ehrenfeucht Fraïssé games. This enables us to show that sentences cannot express some properties in the logic . and prove 0-1 laws for it.
我的巨大
发表于 2025-3-29 17:37:17
A Fully Complete PER Model for ML Polymorphic TypesWe present a . technique for building . categories over .. These PER categories turn out to be . and to form an . with their .. We show that a special linear combinatory algebra of ., arising from . constructions, gives rise to a . and . model for . of system F.
流出
发表于 2025-3-29 22:38:59
http://reply.papertrans.cn/24/2338/233759/233759_48.png
放肆的我
发表于 2025-3-30 00:20:39
Independence: Logics and ConcurrencyWe consider Hintikka et al.’s ‘independence-friendly first-order logic’. We apply it to a modal logic setting, defining a notion of ‘independent’ modal logic, and we examine the associated fixpoint logics.
justify
发表于 2025-3-30 06:24:48
http://reply.papertrans.cn/24/2338/233759/233759_50.png