找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logic, Language, Information, and Computation; 23rd International W Jouko Väänänen,Åsa Hirvonen,Ruy de Queiroz Conference proceedings 2016

[复制链接]
楼主: 相似
发表于 2025-3-27 00:15:29 | 显示全部楼层
Logic, Language, Information, and Computation978-3-662-52921-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-27 01:45:33 | 显示全部楼层
发表于 2025-3-27 05:41:06 | 显示全部楼层
A Logical Approach to Context-Specific Independence,logue of dependence logic suitable to express context-specific independence and study its basic properties. We also consider the problem of finding inference rules for deriving non-local CSI and CI statements that logically follow from the structure of a LDAG but are not explicitly encoded by it.
发表于 2025-3-27 10:09:50 | 显示全部楼层
Sheaves of Metric Structures,etely controlled and understood by the forcing rules in the sheaf and Theorem .. This work extends early constructions due to Comer [.] and Macintyre [.] and later developments due to Caicedo [.], to the context of continuous logic. We illustrate these concepts by studying the metric sheaf of the continuous cyclic flow on tori.
发表于 2025-3-27 17:00:17 | 显示全部楼层
发表于 2025-3-27 21:19:42 | 显示全部楼层
发表于 2025-3-27 22:19:49 | 显示全部楼层
A Classical Propositional Logic for Reasoning About Reversible Logic Circuits,d and complete semantics for this system. We show that all strong equivalences of reversible logic circuits are provable in the system, derive an equivalent equational theory, and describe its main applications in the verification of both reversible circuits and template-based reversible circuit rewriting systems.
发表于 2025-3-28 02:54:09 | 显示全部楼层
Descriptive Complexity of Graph Spectra,e case with ., nor with any number of variables if we exclude counting quantifiers. We also show that the class of graphs that are determined by their spectra is definable in partial fixed-point logic with counting. We relate these properties to other algebraic and combinatorial problems.
发表于 2025-3-28 07:29:20 | 显示全部楼层
Causality in Bounded Petri Nets is MSO Definable,s is recognizable by a saturated slice automaton if and only if . is definable in monadic second order logic. This result generalizes Büchi’s theorem from the context of strings, to the context of .-coverable DAGs.
发表于 2025-3-28 11:14:10 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-22 21:46
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表