Log in

Relevant bibliographies by topics / Logic fibration

Contents

Journal articles
Books
Book chapters
Conference papers

Academic literature on the topic 'Logic fibration'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Logic fibration.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Logic fibration"

1

HASUO, ICHIRO, TOSHIKI KATAOKA, and KENTA CHO. "Coinductive predicates and final sequences in a fibration." Mathematical Structures in Computer Science 28, no. 4 (2017): 562–611. http://dx.doi.org/10.1017/s0960129517000056.

Full text

Abstract:

Coinductive predicates express persisting ‘safety’ specifications of transition systems. Previous observations by Hermida and Jacobs identify coinductive predicates as suitable final coalgebras in a fibration – a categorical abstraction of predicate logic. In this paper, we follow the spirit of a seminal work by Worrell and study final sequences in a fibration. Our main contribution is to identify some categorical ‘size restriction’ axioms that guarantee stabilization of final sequences after ω steps. In its course, we develop a relevant categorical infrastructure that relates fibrations and l

APA, Harvard, Vancouver, ISO, and other styles

2

Termen, Talip Can, and Ozgur Ege. "Digital h-Fibrations and Some New Results on Digital Fibrations." Axioms 13, no. 3 (2024): 180. http://dx.doi.org/10.3390/axioms13030180.

Full text

Abstract:

In this work, the notion of digital fiber homotopy is defined and its properties are given. We present some new results on digital fibrations. Moreover, we introduce digital h-fibrations. We prove some of the properties of these digital h-fibrations. We show that a digital fibration and a digital map p are fiber homotopic equivalent if and only if p is a digital h-fibration. Finally, we explore a relation between digital fibrations and digital h-fibrations.

APA, Harvard, Vancouver, ISO, and other styles

3

Leifer, Ian, Flaviano Morone, Saulo D. S. Reis, José S. Andrade, Mariano Sigman, and Hernán A. Makse. "Circuits with broken fibration symmetries perform core logic computations in biological networks." PLOS Computational Biology 16, no. 6 (2020): e1007776. http://dx.doi.org/10.1371/journal.pcbi.1007776.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

NICOLAIDIS, A., and V. KIOSSES. "SPINOR GEOMETRY." International Journal of Modern Physics A 27, no. 22 (2012): 1250126. http://dx.doi.org/10.1142/s0217751x12501266.

Full text

Abstract:

It has been proposed that quantum mechanics and string theory share a common inner syntax, the relational logic of C. S. Peirce. Along this line of thought we consider the relations represented by spinors. Spinor composition leads to the emergence of Minkowski space–time. Inversely, the Minkowski space–time is istantiated by the Weyl spinors, while the merger of two Weyl spinors gives rise to a Dirac spinor. Our analysis is applied also to the string geometry. The string constraints are represented by real spinors, which create a parametrization of the string worldsheet identical to the Ennepe

APA, Harvard, Vancouver, ISO, and other styles

5

Pagnan, Ruggero. "Concrete Fibrations." Notre Dame Journal of Formal Logic 58, no. 2 (2017): 179–204. http://dx.doi.org/10.1215/00294527-3817788.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Emmenegger, Jacopo, Fabio Pasquali, and Giuseppe Rosolini. "A characterisation of elementary fibrations." Annals of Pure and Applied Logic 173, no. 6 (2022): 103103. http://dx.doi.org/10.1016/j.apal.2022.103103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lamarche, François. "Multiplicative Linear Logics and Fibrations." Electronic Notes in Theoretical Computer Science 69 (February 2003): 227–47. http://dx.doi.org/10.1016/s1571-0661(04)80567-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

HALIMI, BRICE. "LOGICAL CONTEXTUALITY IN FREGE." Review of Symbolic Logic 11, no. 1 (2018): 1–20. http://dx.doi.org/10.1017/s1755020316000320.

Full text

Abstract:

AbstractLogical universalism, a label that has been pinned on to Frege, involves the conflation of two features commonly ascribed to logic: universality and radicality. Logical universality consists in logic being about absolutely everything. Logical radicality, on the other hand, corresponds to there being the one and the same logic that any reasoning must comply with. The first part of this paper quickly remarks that Frege’s conception of logic makes logical universality prevail and does not preclude the admission of different contexts of discourse. The paper then aims to make it clear how F

APA, Harvard, Vancouver, ISO, and other styles

9

Makkai, M. "The fibrational formulation of intuitionistic predicate logic ${\rm I}$: completeness according to Gödel, Kripke, and Läuchli. II." Notre Dame Journal of Formal Logic 34, no. 4 (1993): 471–98. http://dx.doi.org/10.1305/ndjfl/1093633902.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Makkai, M. "The fibrational formulation of intuitionistic predicate logic ${\rm I}$: completeness according to Gödel, Kripke, and Läuchli. I." Notre Dame Journal of Formal Logic 34, no. 3 (1993): 334–77. http://dx.doi.org/10.1305/ndjfl/1093634727.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Logic fibration"

1

Pavlović, Duško. Predicates and fibrations: From type theoretical to category theoretical presentation of constructive logic. [s.n.], 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Logic fibration"

1

Gaboardi, Marco, Shin-ya Katsumata, Dominic Orchard, and Tetsuya Sato. "Graded Hoare Logic and its Categorical Semantics." In Programming Languages and Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_9.

Full text

Abstract:

AbstractDeductive verification techniques based on program logics (i.e., the family of Floyd-Hoare logics) are a powerful approach for program reasoning. Recently, there has been a trend of increasing the expressive power of such logics by augmenting their rules with additional information to reason about program side-effects. For example, general program logics have been augmented with cost analyses, logics for probabilistic computations have been augmented with estimate measures, and logics for differential privacy with indistinguishability bounds. In this work, we unify these various approa

APA, Harvard, Vancouver, ISO, and other styles

2

Ghani, Neil, Patricia Johann, and Clément Fumex. "Fibrational Induction Rules for Initial Algebras." In Computer Science Logic. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15205-4_27.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kinoshita, Y., and A. J. Power. "A fibrational semantics for logic programs." In Extensions of Logic Programming. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-60983-0_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kura, Satoshi. "A General Semantic Construction of Dependent Refinement Type Systems, Categorically." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_21.

Full text

Abstract:

AbstractDependent refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type systems and predicate logic, that is, a construction of liftings of closed comprehension categories from given (underlying) closed comprehension categories and posetal fibrations for predicate logic. We give sufficient conditions to lift structures such as dependent products, dependent sums, computational effects, and recursion from the underlyi

APA, Harvard, Vancouver, ISO, and other styles

5

Lawvere, F. William. "Tools for the Advancement of Objective Logic: Closed Categories and Toposes." In The Logical Foundations of Cognition. Oxford University PressNew York, NY, 1994. http://dx.doi.org/10.1093/oso/9780195092158.003.0004.

Full text

Abstract:

Abstract The thesis is that the explicit adequate development of the science of knowing will require the use of the mathematical theory of categories. Even within mathematical experience, only that theory has approximated a particular model of the general, sufficient as a foundation for a general account of all particulars. Arising 50 years ago from the needs of geometry, category theory has developed such notions as adjoint func•• tor, topos, fibration, closed category, 2-category, etc., in order to provide: (1) A guide to the complex, but very non-arbitrary constructions of the concepts and

APA, Harvard, Vancouver, ISO, and other styles

6

Marti-Oliet, Narciso, and Jose Meseguer. "An algebraic axiomatization of linear logic models." In Topology and Category Theory in Computer Science. Oxford University PressOxford, 1991. http://dx.doi.org/10.1093/oso/9780198537601.003.0013.

Full text

Abstract:

Abstract There are many notions of type in computing. The most classical notion is ‘types as sets’, which has been extended to cover many features of modern programming languages. This chapter shows that such features are handled perhaps even more naturally by an extension of the ‘types as algebras’ notion to a ‘types as theories’ notion. This notion naturally supports object-oriented concepts, including inheritance and local state, as well as generic modules and dependent types. Moreover, it explains why polymorphic operations are natural transformations and provides a systematic foundation f

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Logic fibration"

1

Uemura, Taichi. "Fibred fibration categories." In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. http://dx.doi.org/10.1109/lics.2017.8005084.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Maillard, Kenji, and Paul-Andre Mellies. "A Fibrational Account of Local States." In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2015. http://dx.doi.org/10.1109/lics.2015.45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bonchi, Filippo, Daniela Petrişan, Damien Pous, and Jurriaan Rot. "Coinduction up-to in a fibrational setting." In CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC. ACM, 2014. http://dx.doi.org/10.1145/2603088.2603149.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!