Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ricardo Rodríguez

dblp:322/0654 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 67% Computational complexity · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity › complexity classes › coNP
coNP-completeness
0.612022
One-variable fragments of intermediate logics over linear frames · Inf. Comput. 2022
Logic in computer science › philosophical logic › non-classical logic
intermediate logics
0.612022
One-variable fragments of intermediate logics over linear frames · Inf. Comput. 2022
Logic in computer science
modal logic
0.612022
One-variable fragments of intermediate logics over linear frames · Inf. Comput. 2022
YearPublicationVenuePosition
2022 One-variable fragments of intermediate logics over linear frames
abstract
A correspondence is established between one-variable fragments of (first-order) intermediate logics defined over a fixed countable linear frame and Gödel modal logics defined over many-valued equivalence relations with values in a closed subset of the real unit interval. It is also shown that each of these logics can be interpreted in the one-variable fragment of the corresponding constant domain intermediate logic, which is equivalent to a Gödel modal logic defined over (crisp) equivalence relations. Although the latter modal logics in general lack the finite model property with respect to their frame semantics, an alternative semantics is defined that has this property and used to establish co-NP-completeness results for the one-variable fragments of the corresponding intermediate logics both with and without constant domains.
Xavier Caicedo, George Metcalfe, Ricardo Rodríguez, Olim Frits Tuyt
Inf. Comput.3