SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Enqvist Sebastian) "

Sökning: WFRF:(Enqvist Sebastian)

  • Resultat 1-10 av 31
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Enqvist, Sebastian, et al. (författare)
  • A Structuralist Framework for the Logic of Theory Change
  • 2011
  • Ingår i: Belief revision meets philosophy of science. - 9789048196081
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
    • Belief revision theory and philosophy of science both aspire to shed light on the dynamics of knowledge – on how our view of the world changes (typically) in the light of new evidence. Yet these two areas of research have long seemed strangely detached from each other, as witnessed by the small number of cross-references and researchers working in both domains. One may speculate as to what has brought about this surprising, and perhaps unfortunate, state of affairs. One factor may be that while belief revision theory has traditionally been pursued in a bottom- up manner, focusing on the endeavors of single inquirers, philosophers of science, inspired by logical empiricism, have tended to be more interested in science as a multi-agent or agent-independent phenomenon.
  •  
2.
  • Kehoe, Laura, et al. (författare)
  • Make EU trade with Brazil sustainable
  • 2019
  • Ingår i: Science. - : American Association for the Advancement of Science (AAAS). - 0036-8075 .- 1095-9203. ; 364:6438, s. 341-
  • Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
  •  
3.
  • Afshari, Bahareh, 1981, et al. (författare)
  • Cyclic proofs for the first-order mu-calculus
  • 2024
  • Ingår i: Logic Journal of the IGPL. - : Oxford University Press (OUP). - 1367-0751 .- 1368-9894. ; 32:1, s. 1-34
  • Tidskriftsartikel (refereegranskat)abstract
    • We introduce a path-based cyclic proof system for first-order mu-calculus, the extension of first-order logic by second-order quantifiers for least and greatest fixed points of definable monotone functions. We prove soundness of the system and demonstrate it to be as expressive as the known trace-based cyclic systems of Dam and Sprenger. Furthermore, we establish cut-free completeness of our system for the fragment corresponding to the modal mu-calculus.
  •  
4.
  • Afshari, Bahareh, 1981, et al. (författare)
  • PROOF SYSTEMS FOR TWO-WAY MODAL MU-CALCULUS
  • 2023
  • Ingår i: Journal of Symbolic Logic (JSL). - 0022-4812 .- 1943-5886.
  • Tidskriftsartikel (refereegranskat)abstract
    • We present sound and complete sequent calculi for the modal mu-calculus with converse modalities, aka two-way modal mu-calculus. Notably, we introduce a cyclic proof system wherein proofs can be represented as finite trees with back-edges, i.e., finite graphs. The sequent calculi incorporate ordinal annotations and structural rules for managing them. Soundness is proved with relative ease as is the case for the modal mu-calculus with explicit ordinals. The main ingredients in the proof of completeness are isolating a class of non-wellfounded proofs with sequents of bounded size, called slim proofs, and a counter-model construction that shows slimness suffices to capture all validities. Slim proofs are further transformed into cyclic proofs by means of re-assigning ordinal annotations.
  •  
5.
  •  
6.
  • Carlsnaes, Walter, 1943-, et al. (författare)
  • Editors' Introduction
  • 2011. - 1
  • Ingår i: Foreign Policy Analysis. - London : Sage Publications. - 9781412921442 ; 3:1, s. 7-12
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)
  •  
7.
  • Enqvist, Sebastian, et al. (författare)
  • A coalgebraic view of characteristic formulas in equational modal fixed point logic
  • 2014
  • Ingår i: Coalgebraic Methods in Computer Science : 12th IFIP WG 1.3 International Workshop, CMCS 2014, Colocated with ETAPS 2014, Grenoble, France, April 5-6, 2014, Revised Selected Papers / Lecture notes in computer science (LNCS). - 1611-3349 .- 0302-9743. ; LNCS 8446
  • Konferensbidrag (refereegranskat)
  •  
8.
  •  
9.
  • Enqvist, Sebastian (författare)
  • A new coalgebraic Lindström theorem
  • 2016
  • Ingår i: Journal of Logic and Computation. - : Oxford University Press (OUP). - 0955-792X .- 1465-363X. ; 26:5, s. 1541-1566
  • Tidskriftsartikel (refereegranskat)abstract
    • In a recent article, Alexander Kurz and Yde Venema establish a Lindström theorem for coalgebraic modal logic that is shown to imply a modal Lindström theorem by Maarten de Rijke. A later modal Lindström theorem has been established by Johan van Benthem, and this result still lacks a coalgebraic formulation. The main obstacle has so far been the lack of a suitable notion of ‘submodels’ in coalgebraic semantics, and the problem is left open by Kurz and Venema. In this article, we propose a solution to this problem and derive a general coalgebraic Lindström theorem along the lines of van Benthem's result. We provide several applications of the result.
  •  
10.
  • Enqvist, Sebastian, et al. (författare)
  • An expressive completeness theorem for coalgebraic modal mu-calculi
  • 2017
  • Ingår i: Logical Methods in Computer Science. - 1860-5974. ; 13:2
  • Tidskriftsartikel (refereegranskat)abstract
    • Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas. More specifically, we investigate whether the coalgebraic mu-calculus is the bisimulation-invariant fragment of the monadic second-order language for a given functor. Using automata theoretic techniques and building on recent results by the third author, we show that in order to provide such a characterization result it suffices to find what we call an adequate uniform construction for the coalgebraic type functor. As direct applications of this result we obtain a partly new proof of the Janin-Walukiewicz Theorem for the modal mu-calculus, avoiding the use of syntactic normal forms, and bisimulation invariance results for the bag functor (graded modal logic) and all exponential polynomial functors (including the game functor). As a more involved application, involving additional non-trivial ideas, we also derive a characterization theorem for the monotone modal mu-calculus, with respect to a natural monadic second-order language for monotone neighborhood models.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 31
Typ av publikation
tidskriftsartikel (18)
bokkapitel (6)
konferensbidrag (5)
samlingsverk (redaktörskap) (1)
doktorsavhandling (1)
Typ av innehåll
refereegranskat (25)
övrigt vetenskapligt/konstnärligt (6)
Författare/redaktör
Enqvist, Sebastian (28)
Venema, Yde (6)
Olsson, Erik J (6)
Afshari, Bahareh, 19 ... (2)
Leigh, Graham E., 19 ... (2)
Gärdenfors, Peter (1)
visa fler...
Rothhaupt, Karl-Otto (1)
Weigend, Maximilian (1)
Müller, Jörg (1)
Goranko, Valentin, 1 ... (1)
Farrell, Katharine N ... (1)
Islar, Mine (1)
Krause, Torsten (1)
Uddling, Johan, 1972 (1)
Alexanderson, Helena (1)
Schneider, Christoph (1)
Battiston, Roberto (1)
Enqvist, Sebastian, ... (1)
Marti, Johannes (1)
Lukic, Marko (1)
Pereira, Laura (1)
Riggi, Laura (1)
Cattaneo, Claudio (1)
Jung, Martin (1)
Andresen, Louise C. (1)
Kasimir, Åsa (1)
Wang-Erlandsson, Lan (1)
Sutherland, William ... (1)
Boonstra, Wiebren J. (1)
Vajda, Vivi (1)
Pascual, Unai (1)
Tscharntke, Teja (1)
Brown, Calum (1)
Peterson, Gustaf (1)
Meyer, Carsten (1)
Seppelt, Ralf (1)
Johansson, Maria (1)
Martin, Jean Louis (1)
Olsson, Urban (1)
Hortal, Joaquin (1)
Buckley, Yvonne (1)
Petrovan, Silviu (1)
Schindler, Stefan (1)
Carvalho, Joana (1)
Amo, Luisa (1)
Machordom, Annie (1)
De Smedt, Pallieter (1)
Lindkvist, Emilie (1)
Matos-Maraví, Pável (1)
Bacon, Christine D. (1)
visa färre...
Lärosäte
Lunds universitet (19)
Stockholms universitet (12)
Göteborgs universitet (2)
Kungliga Tekniska Högskolan (1)
Uppsala universitet (1)
Mittuniversitetet (1)
visa fler...
Chalmers tekniska högskola (1)
Sveriges Lantbruksuniversitet (1)
visa färre...
Språk
Engelska (31)
Forskningsämne (UKÄ/SCB)
Humaniora (22)
Naturvetenskap (15)
Samhällsvetenskap (2)
Teknik (1)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy