小步舞
发表于 2025-3-30 08:37:27
Functional Interpretations of Intuitionistic Linear Logicntuitionistic logic via embeddings of .. into ... The main difference from previous work of the second author is that in intuitionistic linear logic the interpretations of !. are simpler (at the cost of an asymmetric interpretation of pure ..) and simultaneous quantifiers are no longer needed for the characterisation of the interpretations.
易于
发表于 2025-3-30 14:23:12
On the Word Problem for ,-Categories, and the Properties of Two-Way Communicationalgorithm, in particular, handles the “additive units” and demonstrates that the complications introduced by the presence of these units can be managed in an efficient manner..This problem is directly related to the problem of determining the equivalence between (finite) processes communicating on a two-way channel.
Lipoma
发表于 2025-3-30 19:04:22
https://doi.org/10.1007/978-3-642-04027-6algorithmic analysis; computer; computer science; decidability; forcing; formal languages; intuitionistic
Cupidity
发表于 2025-3-30 21:06:25
http://reply.papertrans.cn/24/2338/233775/233775_54.png
milligram
发表于 2025-3-31 04:20:25
http://reply.papertrans.cn/24/2338/233775/233775_55.png
注射器
发表于 2025-3-31 08:35:55
http://reply.papertrans.cn/24/2338/233775/233775_56.png
acquisition
发表于 2025-3-31 11:22:55
http://reply.papertrans.cn/24/2338/233775/233775_57.png
Pruritus
发表于 2025-3-31 14:34:17
Fixed-Point Definability and Polynomial TimeMy talk will be a survey of recent results about the quest for a logic capturing polynomial time.
CURB
发表于 2025-3-31 17:45:47
Kleene’s Amazing Second Recursion TheoremThis little gem is stated unbilled and proved (completely) in the last two lines of .2 of the short note Kleene (1938).
巨头
发表于 2025-3-31 23:15:12
Computer Science Logic978-3-642-04027-6Series ISSN 0302-9743 Series E-ISSN 1611-3349