埋葬
发表于 2025-3-27 00:20:41
Learning from Łukasiewicz and Meredith: Investigations into Proof Structureses and studies global features in selected problems and their proofs which offer the potential of guiding proof search in a more direct way. The studied problems are of the wide-spread form of “axiom(s) and rule(s) imply goal(s)”. The features include the well-known concept of lemmas. For their elab
FEIGN
发表于 2025-3-27 03:56:49
http://reply.papertrans.cn/17/1663/166266/166266_32.png
最有利
发表于 2025-3-27 08:53:51
Isabelle’s Metalogic: Formalization and Proof Checkerms. We formalize this metalogic and the language of proof terms in Isabelle/HOL, define an executable (but inefficient) proof term checker and prove its correctness w.r.t. the metalogic. We integrate the proof checker with Isabelle and run it on a range of logics and theories to check the correctnes
盲信者
发表于 2025-3-27 10:49:39
The , Calculus Is a ,-complete Decision Procedure for Non-linear Constraintse investigate properties of the . calculus and show that it is a .-complete decision procedure for bounded problems. We also propose an extension with local linearisations, which allow for more efficient treatment of non-linear constraints.
TAP
发表于 2025-3-27 15:35:13
http://reply.papertrans.cn/17/1663/166266/166266_35.png
gonioscopy
发表于 2025-3-27 20:33:31
Ungleichheitsaversion und Fairness,nductive reasoning are captured as we intuitively understand and use them. Through this framework we demonstrate the enormous potential of non-well-founded deduction, both in the foundational theoretical exploration of (co)inductive reasoning and in the provision of proof support for (co)inductive r
Meditative
发表于 2025-3-28 01:37:11
https://doi.org/10.1007/978-3-662-00554-5e describe an implementation of the procedure and compare its performance with implementations of other calculi for . (for which, however, the termination results were not established). We show possible refinements of our algorithm and discuss the possibility of extending it to other non-Fregean log
Gossamer
发表于 2025-3-28 02:22:26
https://doi.org/10.1007/978-3-662-07493-0hecking algorithms for non-parametric systems, increasingly-larger finite instances of the parametric system. Depending on the verification result in the concrete instance, the abstraction is automatically refined by leveraging canditate lemmas from inductive invariants, or by discarding previously
Indecisive
发表于 2025-3-28 07:43:57
http://reply.papertrans.cn/17/1663/166266/166266_39.png
jarring
发表于 2025-3-28 13:10:37
http://reply.papertrans.cn/17/1663/166266/166266_40.png