Zobrazeno 1 - 10
of 595
pro vyhledávání: '"Quantifier (logic)"'
Publikováno v:
Fuzzy Sets and Systems. 431:129-142
Among the great bunch of additional properties which fuzzy implications may satisfy, the so-called invariance with respect to T-powers highlights due to its applications in approximate reasoning. This property ensures the invariance of the truth valu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e12e6f7fc7164f5bd0a2851c39744414
https://doi.org/10.1016/j.fss.2021.08.006
https://doi.org/10.1016/j.fss.2021.08.006
Autor:
Lexiao Lai, Cédric Josz
Publikováno v:
Optimization Letters. 16:1611-1631
We provide the first positive result on the nonsmooth optimization landscape of robust principal component analysis, to the best of our knowledge. It is the object of several conjectures and remains mostly uncharted territory. We identify a necessary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8abd7297aa486058e7b1ad02e2193e0
https://doi.org/10.1007/s11590-021-01819-9
https://doi.org/10.1007/s11590-021-01819-9
Autor:
Nils Kürbis
Publikováno v:
Studia Logica. 110:219-239
This paper presents rules in sequent calculus for a binary quantifier I to formalise definite descriptions: Ix[F, G] means ‘The F is G’. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1e23fc8a1cbea6d24eb7466caff112d
https://doi.org/10.1007/s11225-021-09958-x
https://doi.org/10.1007/s11225-021-09958-x
Autor:
Florian Lonsing, Roderick Bloem, Nicolas Braud-Santoni, Uwe Egly, Martina Seidl, Vedad Hadzic
Publikováno v:
Formal Methods in System Design. 57:157-177
In recent years, expansion-based techniques have been shown to be very powerful in theory and practice for solving quantified Boolean formulas (QBF), the extension of propositional formulas with existential and universal quantifiers over Boolean vari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44315d0a7d3e8270416272ac172935c8
https://doi.org/10.1007/s10703-021-00371-7
https://doi.org/10.1007/s10703-021-00371-7
Autor:
Karen S. Lewis
Publikováno v:
Linguistics and Philosophy. 45:559-617
Both definite descriptions and pronouns are often anaphoric; that is, part of their interpretation in context depends on prior linguistic material in the discourse. For example: (1) A student walked in. The student sat down. (2) A student walked in.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33bcdb9fe981986b57d03ccfff1b6569
https://doi.org/10.1007/s10988-021-09325-y
https://doi.org/10.1007/s10988-021-09325-y
Autor:
Yanjing Wang, Yanjun Li
Publikováno v:
Synthese. 199:8611-8639
In this paper, we give an alternative semantics to the non-normal logic of knowing how proposed by Fervari et al. (Proc IJCAI 2017:1031–1038, 2017), based on a class of Kripke neighborhood models with both the epistemic relations and neighborhood s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::446731b42a2748a4680ba25e2d059a28
https://doi.org/10.1007/s11229-021-03177-6
https://doi.org/10.1007/s11229-021-03177-6
Autor:
Ernst Zimmermann
Publikováno v:
Journal of Logic, Language and Information. 30:601-631
The paper introduces a new type of rules into Natural Deduction, elimination rules by composition. Elimination rules by composition replace usual elimination rules in the style of disjunction elimination and give a more direct treatment of additive d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d658f23ecc4fbd59f542d4cc45bb7a59
https://doi.org/10.1007/s10849-021-09329-8
https://doi.org/10.1007/s10849-021-09329-8
Publikováno v:
Chebyshevskii sbornik. 22:304-327
The article presents results and open problems related to definability spaces (reducts) and sources of this field since the XIX century. Finiteness conditions and constraints are investigated, including the depth of quantifier alternation and the num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55164d46dc02715fcffd39facfb58c80
https://doi.org/10.22405/2226-8383-2021-22-1-304-327
https://doi.org/10.22405/2226-8383-2021-22-1-304-327
Autor:
Anahit Chubaryan, Hakob A. Tamazyan
Publikováno v:
Mathematical Problems of Computer Science. :138-146
The number of linear proofs steps for some sets of formulas is compared in the folowing systems of propositional calculus: PK – seguent system with cut rule, PK— - the same system without cut rule, SPK – the same system with substitution rule,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd67b2209646bf1519575b8ecf6667e1
https://doi.org/10.51408/1963-0068
https://doi.org/10.51408/1963-0068