{"id":15,"date":"2022-05-19T11:08:07","date_gmt":"2022-05-19T11:08:07","guid":{"rendered":"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/?page_id=15"},"modified":"2026-02-23T14:41:33","modified_gmt":"2026-02-23T14:41:33","slug":"eventos","status":"publish","type":"page","link":"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/eventos\/","title":{"rendered":"Eventos"},"content":{"rendered":"\n<p>2026<\/p>\n\n\n\n<ul>\n<li><strong><a href=\"https:\/\/web.tecnico.ulisboa.pt\/bernardo.toninho\/\">Bernardo Toninho<\/a> <\/strong>(Departamento de Inform\u00e1tica, T\u00e9cnico ULisboa), \u201cMaking Propositions-as-Sessions Run\u201d, Col\u00f3quio de L\u00f3gica, 21 de janeiro de 2026, 17h. Palestra inclu\u00edda nas comemora\u00e7\u00f5es do  <a href=\"https:\/\/worldlogicday.com\/events\/2026\/colloquium-of-logic\">Dia Mundial da L\u00f3gica 2026<\/a>.<details> <summary>Resumo (em ingl\u00eas) <\/summary> In this talk I will overview the last ~10 years of work on the logical foundations of session-based computation, as derived from the propositions as types interpretation of Linear Logic in its classical and intuitionistic forms, with an emphasis on recent work deriving a (session) abstract machine, the SAM, for efficient execution of session-based processes.<\/details><\/li>\n<\/ul>\n\n\n\n<p>2025<\/p>\n\n\n\n<ul>\n<li>Elei\u00e7\u00f5es para os \u00f3rg\u00e3os sociais da SPL, 16-17 de outubro de 2025. Os resultados das elei\u00e7\u00f5es e a constitui\u00e7\u00e3o dos \u00f3rg\u00e3os sociais eleitos para o tri\u00e9nio 2025-2028 encontram-se neste <a href=\"https:\/\/spl.tecnico.ulisboa.pt\/wp-content\/uploads\/2025\/10\/edital_eleicoes_17OUT2025.pdf\">Edital<\/a>.<\/li>\n<\/ul>\n\n\n\n<ul>\n<li><strong><a href=\"https:\/\/sweet.ua.pt\/martins\/index.htm\">Manuel Martins<\/a> <\/strong>(Departamento de Matem\u00e1tica e  Centro de Investiga\u00e7\u00e3o e Desenvolvimento em Matem\u00e1tica e Aplica\u00e7\u00f5es, UAveiro), \u201cPartiality in First-Order Hybrid Logic\u201d, Col\u00f3quio de L\u00f3gica,  29 de maio 2025, 16:30.<details> <summary>Resumo (em ingl\u00eas) <\/summary>    In this talk, I will introduce a language of first-order hybrid logic in which function symbols are interpreted as partial functions. The language builds on the basic propositional hybrid framework, includes a primitive unary predicate symbol for testing whether a term denotes, and employs satisfaction operators to rigidify both predicate and function symbols. Semantically, the system is actualist and allows terms to be undefined. Furthermore, contrary to what is generally assumed, it admits a region inhabited by entities beyond the scope of any actualist quantifier. I will present a sound and complete axiomatization of the system. In addition, I will provide a brief overview of a hybrid partial type theory that combines William Farmer\u2019s partial type theory with a strong form of hybrid logic, focusing on its main features.<\/details><\/li>\n<\/ul>\n\n\n\n<ul>\n<li><strong><a href=\"https:\/\/w3.math.uminho.pt\/~jes\/\">Jos\u00e9 Esp\u00edrito Santo<\/a> <\/strong>(Departamento de Matem\u00e1tica e Centro de Matem\u00e1tica, UMinho), \u201cAn extension of the Curry-Howard correspondence to proof search\u201d, Col\u00f3quio de L\u00f3gica, 7 de fevereiro 2025, 16:00<details> <summary>Resumo (em ingl\u00eas) <\/summary>    A proof is the successful outcome of a proof search run, and such outcome is conveniently represented by a lambda-term. More generally, runs of goal-directed proof search are possibly infinite and are conveniently represented by terms of the coinductive lambda-calculus. For some logics, there is an equivalent, finitary representation, making use of formal fixed points. On such syntax one can base a new approach to the study of proof search. We will review the case study of intuitionistic implicational logic, that is, the theory of simple types. We will consider decision problems (existence of inhabitants, several concepts of finiteness), coherence questions about the uniqueness of inhabitants, and situations where a type either is empty of has infinitely many inhabitants. This is joint work with Ralph Matthes and Lu\u00eds Pinto.<\/details><\/li>\n<\/ul>\n\n\n\n<ul>\n<li><a href=\"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/dia-mundial-da-logica\/\"><strong>Comemora\u00e7\u00e3o do Dia Mundial da L\u00f3gica, 15 janeiro 202<\/strong>5<\/a><br><\/li>\n<\/ul>\n\n\n\n<p>2024<\/p>\n\n\n\n<ul>\n<li><strong><a href=\"https:\/\/sigarra.up.pt\/fcup\/pt\/func_geral.formview?p_codigo=245584\">Sandra Alves<\/a><\/strong> (Departmento de Ci\u00eancia de Computadores, Ci\u00eancias UPorto), \u201cQuantitative Weak Linearisation\u201d, Col\u00f3quio de L\u00f3gica, 14 de novembro 2024, 17:00<details> <summary>Resumo (em ingl\u00eas) <\/summary>Weak linearisation was defined years ago through a static characterisation of the intuitive notion of virtual redex, based on (legal) paths computed from the (syntactical) term tree. Weak-linear terms impose a linearity condition only on functions that are applied (consumed by reduction) and functions that are not applied (therefore persist in the term along any reduction) can be non-linear. This class of terms was shown to be strongly normalising with deciding typability in polynomial time. We revisit this notion through non-idempotent intersection types (also called quantitative types). By using an effective characterisation of minimal typings, based on the notion of tightness, we are able to distinguish between \u201cconsumed\u201d and \u201cpersistent\u201d term constructors, which allows us to define an expansion relation, between general lambda-terms and weak-linear lambda-terms, whilst preserving normal forms by reduction.    <\/details><\/li>\n<\/ul>\n\n\n\n<ul>\n<li><strong><strong><a href=\"https:\/\/www.uevora.pt\/pessoas?id=244557\">Bruno Dinis<\/a><\/strong><\/strong> (Departmento de Matem\u00e1tica, U\u00c9vora), \u201cNonstandard Analysis meets Philosophy\u201d, Col\u00f3quio de L\u00f3gica, 26 de junho 2024, 17:00<details> <summary>Resumo (em ingl\u00eas) <\/summary>Nonstandard analysis (NSA), founded by Abraham Robinson in the 1960\u2019s, was to a great extent inspired by Leibniz\u2019s ideas and intuitions towards the use of infinitesimal and infinitely large quantities. One of the greatest features of NSA is that, by allowing a correct formulation of infinitesimals, one is now able to reason using orders of magnitude. This means that one can give precise meaning, and reason formally, about otherwise vague terms such as \u201csmall\u201d or \u201clarge\u201d. Recently, accounts of vagueness relying on NSA were introduced [2, 8, 4]. In particular, and unlike other accounts of vagueness, the so-called nonstandard primitivist account [4, 5] embraces transitivity for marginal differences (i.e. \u201csmall\u201d differences), but not for large differences in a soritical series. Nonstandard primitivism also seems to be particularly adequate to deal with the ship of Theseus paradox [3, 6] and may also shed some light in doxastic reasoning by considering infinitesimal probabilities and associating them to infinitesimal credences [1, 7]. We aim at assessing the relative merits of nonstandard primitivism and to show some lines of future research regarding the connections between NSA and philosophy. (This is joint work with Bruno Jacinto) [1] Benci, Vieri and Horsten, Leon and Wenmackers, Sylvia. Infinitesimal Probabili- ties. The British Journal for the Philosophy of Science, 69 (2): 509\u2013552, 2018. doi: 10.1093\/bjps\/axw013 [2] Walter Dean. Strict finitism, feasibility, and the sorites. Review of Symbolic Logic, 11 (2):295\u2013346, 2018. doi: 10.1017\/S1755020318000163. [3] Bruno Dinis. Equality and near-equality in a nonstandard world. Log. Log. Philos., 32 (1):105\u2013118, 2023. ISSN 1425-3305,2300-9802. [4] Bruno Dinis and Bruno Jacinto. A theory of marginal and large difference. Erkenntnis, 2023. [5] Bruno Dinis and Bruno Jacinto. Marginality scales for gradable objects. (preprint), 2023. [6] Bruno Dinis and Bruno Jacinto. Counterparts as Near-equals. (preprint), 2024. [7] Kenny Easwaran. Regularity and Hyperreal Credences. Philosophical Review, 123 (1):1- 41, 2014. [8] Yair Itzhaki. Qualitative versus quantitative representation: a non-standard analysis of the sorites paradox. Linguistics and Philosophy, 44:1013\u20131044, 2021. URL https: \/\/doi.org\/10.1007\/s10988-020-09306-7.  <\/details><\/li>\n<\/ul>\n\n\n\n<ul>\n<li><strong><a href=\"https:\/\/arsr.inesc-id.pt\/~agianola\/\">Alessandro Gianol<\/a><\/strong><a href=\"https:\/\/brunoloff.wordpress.com\/\"><strong>a <\/strong><\/a>(Departmento de Inform\u00e1tica e INESC, T\u00e9cnico ULisboa), &#8220;Uniform Interpolation in Formal Verification\u201d, Col\u00f3quio de L\u00f3gica, 16 de maio de 2024, 17:00 <details> <summary>Resumo (em ingl\u00eas) <\/summary>  In the last two decades, Craig interpolation has emerged as an essential tool in formal verification, where first-order theories are used to express constraints on the system, such as on the datatypes manipulated by programs. Interpolants for such theories are largely exploited as an efficient method to approximate the reachable states of the system and for invariant synthesis. In this talk, we report recent results on a stronger form of interpolation, called uniform interpolation, and its connection with the notion of model completion from model-theoretic algebra. We discuss how uniform interpolants can be used in the context of formal verification of infinite-state systems to develop effective techniques for computing the reachable states in an exact way. Finally, we present some results about the transfer of uniform interpolants to theory combinations. We argue that methods based on uniform interpolation are particularly effective and computationally efficient when applied to verification of the so-called data-aware processes: these are systems where the control flow of a process can interact with a data storage. <\/details><\/li>\n<\/ul>\n\n\n\n<ul>\n<li><a href=\"https:\/\/brunoloff.wordpress.com\/\"><strong>Bruno Loff <\/strong><\/a>(Departamento de Matem\u00e1tica e and LASIGE, Ci\u00eancias ULisboa), &#8220;Why is solving the P vs NP problem so hard?&#8221;, Col\u00f3quio de L\u00f3gica, 11 de abril de 2024, 17:00<details> <summary>Resumo (em ingl\u00eas) <\/summary>  I will give a board-and-chalk-and-informal-talk presentation about the difficulty of proving lower-bounds in computational complexity.  The P vs NP problem is one of the most famous unsolved problems in mathematics. One may phrase the P vs NP question in various equivalent ways. One way, which is not completely equivalent, but almost, is the following (&#8220;P\/poly vs NP problem&#8221;). Does there exist a small Boolean circuit which solves the CLIQUE problem? I.e., does there exist a poly(N)-size Boolean circuit which, when given as input the NxN adjacency matrix of an undirected graph, decides whether the graph has a clique of size N\/2?  Complexity theorists, me included, believe that the answer is no. We believe that there exists a super-polynomial &#8220;lower-bound&#8221; on the complexity of CLIQUE. Many people have tried proving such a lower-bound, and so far all have failed. But why? Why is the problem so difficult?  In the late 1980s, Alexander Razborov proved that there exist no poly(N)-size &#8220;monotone&#8221; circuits for solving CLIQUE. Namely, if we forbid the Boolean circuit from doing negations, so they can only do ORs and ANDs, then polysize circuits cannot solve the CLIQUE problem. He (and many others) then tried to prove the same result for ordinary circuits (with negation gates). And he failed (and they all failed, too). But along the way he (and many others) proved many different lower-bounds. Lower-bounds for simpler kinds of circuits (e.g. constant-depth), lower-bounds for communication protocols (a different but related computational model), and lower-bounds for other models. Razborov proved these lower-bounds, and he also thought long and hard about why lower-bounds against Boolean circuits were so difficult to prove.  In 1994, Razborov and Stephen Rudich presented their paper, &#8220;natural proofs&#8221;, which had a very reasonable explanation for why circuit lower-bounds were difficult to prove. They showed, remarkably, that every single lower-bound proof that was known at the time had a certain &#8220;logical structure&#8221; (or could be made to have such a structure by small changes to the argument). This logical structure made the proof very simple and natural, and they called proofs with such a structure &#8220;natural proofs&#8221;. Then they showed that super-polynomial lower-bounds on CLIQUE cannot be shown using natural proofs, unless certain cryptographic primitives, such as factoring, are unsecure. This is a kind of informal independence result. (Based on the natural proofs result, Razborov also later proved formal independence results, showing that P vs NP is independent of certain weak systems of arithmetic, but I do now know the details of those.)  In one fell swoop, Razborov and Rudich ruled out every single lower-bound technique known at the time, saying: these techniques are not enough to solve the P vs NP problem (unless cryptography is insecure). To a very large extent this barrier still applies today, as almost all the lower-bound proofs that we know are natural proofs, i.e., they have the very same logical structure as the proofs known since the 1980s.  In this seminar, I will explain what is a &#8220;natural proof&#8221;, and why it is reasonable to expect that no natural proof can solve the P vs NP problem. Only a few words will be said about some of my research and how it connects to this topic.  <\/details><\/li>\n<\/ul>\n\n\n\n<ul>\n<li><a href=\"https:\/\/spl.tecnico.ulisboa.pt\/conference\"><strong>Days in Logic<\/strong><\/a>, 1-3 de fevereiro, 2024, T\u00e9cnico ULisboa<\/li>\n<\/ul>\n\n\n\n<p>2023<\/p>\n\n\n\n<ul>\n<li><a rel=\"noreferrer noopener\" href=\"https:\/\/www.ifch.unicamp.br\/ifch\/colaboradores\/filosofia\/650\/walter-alexandre-carnielli\" target=\"_blank\"><strong>Walter A. Carnielli<\/strong><\/a> (Departamento de&nbsp; Filosofia e Centro de&nbsp; L\u00f3gica, Epistemologia e Ci\u00eancias Humanas &#8211; UNICAMP, Brasil), &#8220;A engenharia e a matem\u00e1tica s\u00e3o humanas, assim como as humanidades devem ser engenhos: juntando o que n\u00e3o&nbsp; deveria ser separado&#8221;, Col\u00f3quio de L\u00f3gica, 27 de fevereiro  de 2023, 17:30 <details> <summary>Resumo<\/summary> As ra\u00edzes hist\u00f3ricas da divis\u00e3o entre engenharia, matem\u00e1tica e ci\u00eancias naturais, por um lado, e ci\u00eancias humanas e artes, por outro, remontam ao per\u00edodo Renascentista e Iluminista, com heran\u00e7a da divis\u00e3o entre o Quadrivium, com aritm\u00e9tica, geometria, m\u00fasica e astronomia, e o Trivium, enfatizando as humanidades. O interesse em classificar e organizar o conhecimento levou \u00e0 divis\u00e3o entre diferentes campos e disciplinas. As ci\u00eancias naturais e a matem\u00e1tica foram vistas como objetivas e baseadas em princ\u00edpios universais, enquanto as ci\u00eancias humanas e as artes foram vistas como subjetivas e baseadas em opini\u00f5es e interpreta\u00e7\u00f5es pessoais. Mas isso tudo est\u00e1 mudando com velocidade espantosa, como comprovam o Metaverso, o GPT3, e o ChatGPT, e o Unreal Engine, a avan\u00e7ad\u00edssima ferramenta de cinema e cria\u00e7\u00e3o 3D em tempo real para experi\u00eancias imersivas e desenvolvimento para novos produtos comerciais. Os engenheiros deveriam se debru\u00e7ar em conhecimentos e insights das artes, literatura e produ\u00e7\u00e3o de filmes para criar produtos e sistemas mais atraentes e f\u00e1ceis de usar. Por exemplo, entender t\u00e9cnicas de narrativa ([4]) pode influenciar o design de jogos eletr\u00f4nicos e interfaces de usu\u00e1rio. Da mesma forma, conhecimentos de psicologia e sociologia humana podem ajudar a criar produtos e sistemas mais \u00fateis e ben\u00e9ficos ([3]). Por outro lado, os fil\u00f3sofos e cientistas humanos podem se beneficiar prestando aten\u00e7\u00e3o \u00e0 engenharia e \u00e0 matem\u00e1tica ([1]), ganhando uma melhor compreens\u00e3o das tecnologias e sistemas que moldam nossas vidas. Alguns autores j\u00e1 se referem \u00e0 teoria do processo dual, combinando o pensamento intuitivo, que \u00e9 pensamento associativo, autom\u00e1tico, paralelo e subconsciente, e pensamento deliberativo, que \u00e9 baseado em regras, serial e consciente, como o que prop\u00f5e o programa de L\u00f3gica Computacional ([2]). Pretendo discutir estas ideias e alguns casos reais para ilustrar que para al\u00e9m das das quest\u00f5es pr\u00e1ticas, o tema envolve t\u00f3picos de interesse filos\u00f3fico e de metodologia. <br> [1] Walter Carnielli. How AI can be surprisingly dangerous for the philosophy of mathematics\u2014 and of science. Circumscribere,  Vol. 27, 2021. <br> [2] Robert Kowalski. Computational Logic and Human Thinking: How to Be Artificially Intelligent Illustrated Edition. Cambridge University Press, 2011. <br> [3] P.N. Johnson-Laird,  S. Khemlani e  G.  P. Goodwin. Logic, probability, and human reasoning. Trends in Cognitive Sciences 19(4)  2015, p. 201-214. <br> [4] Robert J. Shiller. Narrative Economics: How Stories Go Viral and Drive Major Economic Events. Princeton University Press, 2020. <\/details><\/li>\n<\/ul>\n\n\n\n<p>2022<\/p>\n\n\n\n<ul>\n<li><a rel=\"noreferrer noopener\" href=\"https:\/\/cfcul.ciencias.ulisboa.pt\/equipa\/olga-pombo\/\" target=\"_blank\"><strong>Olga Pombo<\/strong><\/a> (Ci\u00eancias ULisboa), &#8220;O Lugar de Leibniz na Hist\u00f3ria da L\u00f3gica&#8221;, Col\u00f3quio de L\u00f3gica, 15 de novembro  de 2022, 17:30 <details> <summary>Resumo<\/summary> Leibniz \u00e9 universalmente reconhecido como um dos mais importantes precursores da l\u00f3gica moderna. Procuraremos percorrer os grandes temas do pensamento l\u00f3gico de Leibniz, apurar o sentido de que eles se revestem face aos desenvolvimentos cient\u00edficos e filos\u00f3ficos que lhes servem de fundo (nomeadamente, no que se refere \u00e0s dificuldades da l\u00f3gica formal tradicional, ao intuicionismo dogm\u00e1tico de Descartes e \u00e0 exemplaridade da matem\u00e1tica). Procuraremos ainda sinalizar a especificidade dos projectos leibnizianos da Mathesis Universalis e de uma extens\u00e3o m\u00e1xima da ideia de l\u00f3gica enquanto Generalissima Ars Cogitandi, identificar os fundamentos do seu projecto de uma l\u00f3gica formalizada, algor\u00edtmica e mecaniz\u00e1vel e, finalmente, discutir as potencialidades e os limites dos esfor\u00e7os e realiza\u00e7\u00f5es de Leibniz no campo da constru\u00e7\u00e3o de uma linguagem simb\u00f3lica geral, categ\u00f3rica, completa e universal. Teremos ainda oportunidade de salientar de que modo a concep\u00e7\u00e3o cognitiva da linguagem de Leibniz faz dele um pioneiro da teoria da computa\u00e7\u00e3o. <\/details><\/li>\n<\/ul>\n\n\n\n<ul>\n<li><a rel=\"noreferrer noopener\" href=\"https:\/\/cfcul.ciencias.ulisboa.pt\/equipa\/antonio-zilhao\/\" target=\"_blank\"><strong>Ant\u00f3nio Zilh\u00e3o<\/strong><\/a> (Letras ULisboa), &#8220;Conceito e L\u00f3gica em Frege&#8221;,  Col\u00f3quio de L\u00f3gica, 27 de outubro de 2022, 16:30 <details> <summary>Resumo<\/summary> Gottlob Frege (1848-1925) \u00e9 conhecido nos meios l\u00f3gico-filos\u00f3ficos sobretudo por ter protagonizado tr\u00eas feitos, todos eles not\u00e1veis: ter introduzido na L\u00f3gica moderna uma teoria formal da quantifica\u00e7\u00e3o; ter concebido um sofisticado programa logicista no \u00e2mbito da Filosofia da Matem\u00e1tica; e ter desenvolvido um g\u00e9nero de investiga\u00e7\u00e3o com um forte conte\u00fado sem\u00e2ntico que inspirou (de um modo algo equ\u00edvoco, h\u00e1 que diz\u00ea-lo) o advento do chamado linguistic turn, operado pela Filosofia Anal\u00edtica na segunda metade do s\u00e9culo XX. H\u00e1, todavia, um outro feito igualmente not\u00e1vel protagonizado por Frege no \u00e2mbito do seu trabalho, mas que costuma ser bastante menos mencionado do que os anteriores: ter proposto uma vis\u00e3o inteiramente nova do conceito. Na realidade, este \u00faltimo feito n\u00e3o s\u00f3 n\u00e3o \u00e9 menos relevante do que os anteriores como se encontra, para o bem e para o mal, subjacente aos mesmos. Nesta comunica\u00e7\u00e3o, irei tentar justificar esta tese, salientando a novidade e a originalidade do tratamento fregeano do conceito, bem assim como o seu alcance l\u00f3gico-filos\u00f3fico. <\/details><\/li>\n<\/ul>\n\n\n\n<ul>\n<li>\u00daltima aula da Professora Cristina Sernadas , 27 de setembro, 2022, T\u00e9cnico ULisboa (<a href=\"https:\/\/spl.tecnico.ulisboa.pt\/wp-content\/uploads\/2022\/09\/cartazCSS.pdf\">programa<\/a>).<\/li>\n<\/ul>\n\n\n\n<ul>\n<li>Elei\u00e7\u00f5es para os \u00f3rg\u00e3os sociais da SPL, 24-25 de junho de 2022. Os resultados das elei\u00e7\u00f5es e a constitui\u00e7\u00e3o dos \u00f3rg\u00e3os sociais eleitos para o tri\u00e9nio 2022-2025 encontram-se neste <a rel=\"noreferrer noopener\" href=\"https:\/\/spl.tecnico.ulisboa.pt\/wp-content\/uploads\/2022\/09\/edital_eleicoes_25JUN22.pdf\" target=\"_blank\">Edital<\/a>.<\/li>\n<\/ul>\n\n\n\n<p class=\"has-medium-font-size\"><\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>2026 2025 2024 2023 2022<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-global-header-display":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"disabled","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","footnotes":""},"_links":{"self":[{"href":"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/wp-json\/wp\/v2\/pages\/15"}],"collection":[{"href":"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/wp-json\/wp\/v2\/comments?post=15"}],"version-history":[{"count":82,"href":"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/wp-json\/wp\/v2\/pages\/15\/revisions"}],"predecessor-version":[{"id":1038,"href":"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/wp-json\/wp\/v2\/pages\/15\/revisions\/1038"}],"wp:attachment":[{"href":"https:\/\/groups.tecnico.ulisboa.pt\/~spl.daemon\/wp-json\/wp\/v2\/media?parent=15"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}