定点
发表于 2025-3-26 22:41:29
On the Construction of Analytic Sequent Calculi for Sub-classical Logics,First, a general syntactic criterion for analyticity in the family of pure sequent calculi is presented. Next, given a basic calculus admitting this criterion, we provide a method to construct weaker pure calculi by collecting simple derivable rules of the basic calculus. The obtained calculi are an
绝缘
发表于 2025-3-27 01:28:19
http://reply.papertrans.cn/59/5881/588061/588061_32.png
垫子
发表于 2025-3-27 08:41:12
Ulrich Kohlenbach,Pablo Barceló,Ruy QueirozUp-to-date results.Fast-conference proceedings tracks.Inter-disciplinary Research
NAVEN
发表于 2025-3-27 10:44:34
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588061.jpg
红润
发表于 2025-3-27 16:24:52
http://reply.papertrans.cn/59/5881/588061/588061_35.png
愚蠢人
发表于 2025-3-27 17:58:32
http://reply.papertrans.cn/59/5881/588061/588061_36.png
让步
发表于 2025-3-27 22:38:38
Logic, Language, Information, and Computation978-3-662-44145-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
Toxoid-Vaccines
发表于 2025-3-28 06:11:18
Definability for Downward and Vertical XPath on Data Trees,sufficient conditions for a class of pointed data trees to be definable by a set of formulas or by a single formula of each of the studied logics. To do so, we introduce a notion of saturation, and show that over saturated data trees bisimulation coincides with logical equivalence.
Rodent
发表于 2025-3-28 07:03:05
Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and ramming and formal grammars. In particular, the results of the paper lead to a natural generalization of the model intersection theorem for definite logic programs, to the more general class of normal logic programs. Moreover, the obtained results also offer the first (to our knowledge) model intersection result for Boolean grammars.
coalition
发表于 2025-3-28 13:42:00
On the Broader Epistemological Significance of Self-Justifying Axiom Systems,our previous infinite-sized self-verifying logics into formalisms or purely finite size). It will explain how self-justification is useful, even when the Incompleteness Theorem clearly limits its scope.