Results 21 to 30 of about 58,074 (157)
Model-theoretic characterization of intuitionistic propositional formulas [PDF]
Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional ...
Olkhovikov, Grigory K.
core +3 more sources
The modal logic of Reverse Mathematics [PDF]
The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way.
Mummert, Carl +2 more
core +1 more source
Quantified Boolean formulas (QBFs) generalize propositional formulas by admitting quantifications over propositional variables. QBFs can be viewed as (restricted) formulas of first-order predicate logic and easy translations of QBFs into first-order ...
Egly, Uwe
core +2 more sources
The Deduction Theorem for Strong Propositional Proof Systems [PDF]
This paper focuses on the deduction theorem for propositional logic. We define and investigate different deduction properties and show that the presence of these deduction properties for strong proof systems is powerful enough to characterize the ...
C. Glaßer +19 more
core +1 more source
We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an ...
A David +30 more
core +1 more source
Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic properties of the
Panti, Giovanni
core +3 more sources
Munoz, Pinto and Fuentes work is supported by the European Union’s H2020 research and innovation programme under grant agreement DAEMON 101017109, by the projects co-financed by FEDER, Spain funds LEIA UMA18-FEDERJA-15, IRIS PID2021- 122812OB-I00 (MCI/AEI), and the PRE2019-087496 grant from the Ministerio de Ciencia e Innovación.
Daniel-Jesus Munoz +3 more
openaire +3 more sources
Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction [PDF]
We consider the quantified constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quantification, whether or not the sentence is true on ...
Chen, Hubie
core +4 more sources
Objective The objective was to identify factors determining acute arthritis resolution and safety with colchicine and prednisone in acute calcium pyrophosphate (CPP) crystal arthritis. Methods We conducted a post hoc analysis of the COLCHICORT trial, which compared colchicine and prednisone for the treatment of acute CPP crystal arthritis, using a ...
Tristan Pascart +14 more
wiley +1 more source
Data‐Driven Distributed Safe Control Design for Multi‐Agent Systems
This paper presents a data‐driven control barrier function (CBF) technique for ensuring safe control of multi‐agent systems (MASs) with uncertain linear dynamics. A data‐driven quadratic programming (QP) optimization is first developed for CBF‐based safe control of single‐agent systems using a nonlinear controller. This approach is then extended to the
Marjan Khaledi, Bahare Kiumarsi
wiley +1 more source

