On Graph-theoretic Fibring of Logics

dc.creatorSernadas, A
dc.creatorSernadas, C
dc.creatorRasga, J
dc.creatorConiglio, M
dc.date2009
dc.dateDEC
dc.date2014-11-14T04:18:03Z
dc.date2015-11-26T17:13:14Z
dc.date2014-11-14T04:18:03Z
dc.date2015-11-26T17:13:14Z
dc.date.accessioned2018-03-29T00:01:36Z
dc.date.available2018-03-29T00:01:36Z
dc.identifierJournal Of Logic And Computation. Oxford Univ Press, v. 19, n. 6, n. 1321, n. 1357, 2009.
dc.identifier0955-792X
dc.identifierWOS:000273177000019
dc.identifier10.1093/logcom/exp024
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/67634
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/67634
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/67634
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1281522
dc.descriptionA graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (in-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is an m-graph whose nodes are language expressions and the in-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided.
dc.description19
dc.description6
dc.description1321
dc.description1357
dc.languageen
dc.publisherOxford Univ Press
dc.publisherOxford
dc.publisherInglaterra
dc.relationJournal Of Logic And Computation
dc.relationJ. Logic Comput.
dc.rightsfechado
dc.rightshttp://www.oxfordjournals.org/access_purchase/self-archiving_policyb.html
dc.sourceWeb of Science
dc.subjectFibring
dc.subjectgraph-theoretic techniques
dc.subjectpreservation results
dc.subjectcombination of logics
dc.subjectcollapsing problem
dc.subjectPreservation
dc.titleOn Graph-theoretic Fibring of Logics
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución