Results 1 to 10 of about 555,741 (309)
Analytic Tableaux for Simple Type Theory and its First-Order Fragment [PDF]
We study simple type theory with primitive equality (STT) and its first-order fragment EFO, which restricts equality and quantification to base types but retains lambda abstraction and higher-order variables.
Chad E. Brown, Gert Smolka
doaj +3 more sources
Kripke Semantics for Martin-L\"of's Extensional Type Theory [PDF]
It is well-known that simple type theory is complete with respect to non-standard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed categories. Similarly,
Steve Awodey, Florian Rabe
doaj +4 more sources
Complete Trigger Selection in Satisfiability modulo first-order Theories [PDF]
Let T be an SMT solver with no theory solvers except for Quantifier Instantiation. Given a set of first-order clauses S saturated by Resolution (with a valid literal selection function) we show that T is complete if its Trigger function is the same as the literal selection function. So if T halts with a ground model G, then G can be extended to a model
Christopher S. Lynch, Stephen Miner
openalex +3 more sources
A Complete Mechanization of Second-Order Type Theory [PDF]
A generalization of the resolution method for higher order logic is presented. The languages acceptable for the method are phrased in a theory of types of order w (all finite types)—including the λ-operator, propositional functors, and quantifiers.
Tomasz Pietrzykowski
openalex +2 more sources
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory (Extended Version) [PDF]
AbstractWe study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic natural deduction and sequent calculi with respect to model-theoretic, algebraic, and game-theoretic semantics.
Yannick Forster +2 more
+6 more sources
A Case Study on Logical Relations using Contextual Types [PDF]
Proofs by logical relations play a key role to establish rich properties such as normalization or contextual equivalence. They are also challenging to mechanize.
Andrew Cave, Brigitte Pientka
doaj +4 more sources
Toward a Stochastic Complete Active Space Second-Order Perturbation Theory
In this work an internally contracted Stochastic Complete Active Space Second Order Perturbation Theory, Stochastic–CASPT2, is reported. The method relies on stochastically sampled reduced density matrices (RDMs) up to rank four and con- tractions thereof with the generalized Fock matrix.
Arta Anushirwan Safari +2 more
openalex +3 more sources
Modelling Probabilistic Wireless Networks [PDF]
We propose a process calculus to model high level wireless systems, where the topology of a network is described by a digraph. The calculus enjoys features which are proper of wireless networks, namely broadcast communication and probabilistic behaviour.
Andrea Cerone, Matthew Hennessy
doaj +7 more sources
ON THE CATEGORICITY OF COMPLETE SECOND-ORDER THEORIES
Abstract We show, assuming PD, that every complete finitely axiomatized second-order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second-order theory with a countable model which is non-categorical.
Tapio Saarinen +2 more
openalex +3 more sources
Complete analysis of pion–nucleon scattering in chiral perturbation theory to third order [PDF]
We consider pion-nucleon scattering in heavy-baryon chiral perturbation theory to third order. All electromagnetic corrections appearing to this order are included. We thus have a consistent description of strong and electromagnetic effects, which allows us to isolate the strong part of the interaction in an unambiguous way.
Nadia Fettes, Ulf-G. Meißner
+7 more sources

