Creating and sharing knowledge for telecommunications
... Sérgio Roseiro Teles Marcelino

Researcher

Sérgio Marcelino

Academic position: Researcher
Joining date: 01-01-2012
Roles in IT: Researcher
Scientific Area: Basic Sciences and Enabling Technologies
Group: Security and Quantum Information - Lx

Email: Send Email
Address: IT – Lisboa
Instituto Superior Técnico - Torre Norte - Piso 10
Av. Rovisco Pais, 1
1049 - 001 Lisboa
Tel: +351 21 841 84 54
Fax: +351 21 841 84 72


Scientific Achievements

  • PhD, King's College London - University of London, 01-01-2012
  • MSc, Instituto Superior Técnico, 01-01-2007
  • S. Marcelino, C. Caleiro, Analytic Calculi for Monadic PNmatrices, Chapter in, Logic, Language, Information, and Computation, WoLLIC 2019, LNCS, vol 11541, Springer Berlin Heidelberg, Berlin, 2019
  • S. Marcelino, C. Caleiro, U. Rivieccio, Plug and Play Negations, Chapter in, Contradictions, from Consistency to Inconsistency, W. Carnielli and J. Malinowski, Springer International Publishing AG Springer Nature, Cham, 2018
  • C. Caleiro, S. Marcelino, J. Marcos, Merging fragments of classical logic, Chapter in, Frontiers of Combining Systems (FroCoS 2017), Springer, Heidelberg, 2017
  • S. Marcelino, C. Caleiro, Disjoint Fibring of Non-deterministic Matrices, Chapter in, Logic, Language, Information, and Computation, WoLLIC 2017, LNCS, vol 10388, Kennedy J., de Queiroz R., Springer Berlin Heidelberg, Berlin, 2017
  • C. Caleiro, S. Marcelino, P. Baltazar, Deciding theoremhood in fibred logics without shared connectives, Chapter in, JY Beziau's Festschrift, A. Buchsbaum, A. Koslow, Springer, 2014
  • A. Kurucz, S. Marcelino, Finite frames for K4.3 × S5 are decidable, Chapter in, Advances in Modal Logic, Volume 9, College Publications, London, 2012
  • C. Hampson, S. Kikot, A. Kurucz, S. Marcelino, Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations, Annals of Pure and Applied Logic, Vol. 171, No. 5, pp. 1 - 44, January, 2020 | BibTex
  • S. Marcelino, C. Caleiro, J. Marcos, Combining fragments of classical logic: When are interaction principles needed?, Soft Computing, Vol. 23, No. 7, pp. 2213 - 2231, October, 2019 | BibTex
  • S. Marcelino, C. Caleiro, Axiomatizing non-deterministic many-valued generalized consequence relations, Synthese, Vol. 00, No. 00, pp. 00 - 00, February, 2019 | BibTex
  • C. Caleiro, S. Marcelino, U. Rivieccio, Characterizing finite-valuedness, Fuzzy Sets and Systems, Vol. 345, No. 0, pp. 113 - 125, October, 2018 | BibTex
  • S. Marcelino, U. Rivieccio, Locally tabular ̸= locally finite, Logica Universalis, Vol. 11, No. 3, pp. 383 - 400, September, 2017 | BibTex
  • S. Marcelino, C. Caleiro, On the characterization of fibred logics, with applications to conservativity and finite-valuedness, Journal of Logic and Computation, Vol. 27, No. 7, pp. 2063 - 2088, August, 2016,
    | Abstract
    | BibTex
  • S. Marcelino, C. Caleiro, Decidability and complexity of fibred logics without shared connectives, Logic Journal of the IGPL, Vol. 24, No. 5, pp. 673 - 707, June, 2016,
    | Abstract
    | BibTex
  • S. Marcelino, A. Kurucz, Non-finitely axiomatisable two-dimensional modal logics, Journal of Symbolic Logic, Vol. 77, No. 3, pp. 970 - 986, March, 2014,
    | Abstract
    | BibTex
  • D. Gabbay, S. Marcelino, Global view on reactivity: switch graphs and their logics, Annals of Mathematics and Artificial Intelligence, Vol. 66, No. 1, pp. 131 - 162, June, 2012 | BibTex
  • S. Marcelino, D. Gabbay, Modal Logics of Reactive Frames, Studia Logica, Vol. 93, No. 2-3, pp. 405 - 446, November, 2009 | BibTex
  • S. Marcelino, P. Resende, An algebraic generalization of Kripke structures, Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 145, No. 03, pp. 549 - 549, July, 2008 | BibTex

Closed Projects2

Acronym Name Funding Agency Start date Ending date
KLog KLog - Logics for Security FCT/PTDC 01-08-2007 01-08-2010
MoLC Modular Analysis of Logical Calculli FCT 01-11-2017 01-11-2020
  • Annals of Mathematics and Artificial Intelligence
    2010, 1 review(s);