Results 31 to 40 of about 455,476 (286)
Intermediate Logics and the de Jongh property [PDF]
Archive for Mathematical Logic, 2010 Dick de Jongh proved in an unpublished paper that the propositional logic of Heyting's arithmetic, \textbf{HA}, is precisely \textbf{IPC}, that means that, for any proposition \(A(p_1,\dots, p_n)\), \(\mathbf{IPC}\vdash A(p_1,\dots, p_n)\) if and and only if \(\mathbf{HA}\vdash A(B_1,\dots, B_n)\), for all arithmetical sentences \(B_1,\dots, B_n ...
de Jongh, D., Verbrugge, R., Visser, A.
openaire +7 more sources
A Direct Version of Veldman's Proof of Open Induction on Cantor Space via Delimited Control Operators [PDF]
, 2014 First, we reconstruct Wim Veldman's result that Open Induction on Cantor space can be derived from Double-negation Shift and Markov's Principle. In doing this, we notice that one has to use a countable choice axiom in the proof and that Markov's ...
Ilik, Danko, Nakata, Keiko
core +5 more sources
Characterization of strongly equivalent logic programs in intermediate logics [PDF]
Theory and Practice of Logic Programming, 2003 The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of strong equivalence between logical programs that can be verified in 3-valued Gödel logic, G3, the strongest non-classical intermediate propositional logic (Lifschitz et al., 2001).
Dick De Jongh, Lex Hendriks
openaire +2 more sources
Languages of Dot-depth One over Infinite Words [PDF]
, 2011 Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential first-order logic.
Kufleitner, Manfred, Lauser, Alexander
core +1 more source
Neutrosophic routes in multiverse of communication [PDF]
Neutrosophic Sets and Systems, 2014 Florentin Smarandache and Ştefan Vlăduţescu the authors and coordinators of the book “Communication Neutrosophic Routes”, published by Education Publishing, Ohio, USA, on 2014, are two remarcable professors, with many researches in neutrosophical ...
Daniela Gîfu, Mirela Teodorescu
doaj
Faithful Modeling of Product Lines with Kripke Structures and Modal Logic [PDF]
Scientific Annals of Computer Science, 2016 Software product lines are now an established framework for software design. They are specified by special diagrams called feature models. For formal analysis, the latter are usually encoded by Boolean propositional theories.
Z. Diskin +3 more
doaj +1 more source
FPGA-Based Implementation of Ship Detection for Satellite On-Board Processing
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2022 At present, the raw echo data captured by spaceborne synthetic aperture radar is usually downlinked to the ground stations for imaging and analysis. If the SAR data can be processed on-board, the processing results could be transmitted to users directly ...
Ming Xu +5 more
doaj +1 more source
Characterizing intermediate tense logics in terms of Galois connections
, 2014 We propose a uniform way of defining for every logic ${\sf L}$ intermediate between intuitionistic and classical logics, the corresponding intermediate minimal tense logic ${\sf LK_t}$.
Dzik, Wojciech +2 more
core +1 more source
Neighbourhood Structures: Bisimilarity and Basic Model Theory [PDF]
Logical Methods in Computer Science, 2009 Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic.
Helle Hvid Hansen +2 more
doaj +1 more source
Multiple Conclusion Rules in Logics with the Disjunction Property
, 2015 We prove that for the intermediate logics with the disjunction property any basis of admissible rules can be reduced to a basis of admissible m-rules (multiple-conclusion rules), and every basis of admissible m-rules can be reduced to a basis of ...
A Chagrov +31 more
core +1 more source