Results 21 to 30 of about 37,312 (297)
Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics [PDF]
Logical Methods in Computer Science, 2008 Church's Higher Order Logic is a basis for influential proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible.
Robert Constable, Wojciech Moczydlowski
doaj +1 more source
Point-free Construction of Real Exponentiation [PDF]
Logical Methods in Computer Science, 2022 We define a point-free construction of real exponentiation and logarithms, i.e.\ we construct the maps $\exp\colon (0, \infty)\times \mathbb{R} \rightarrow \!(0,\infty),\, (x, \zeta) \mapsto x^\zeta$ and $\log\colon (1,\infty)\times (0, \infty ...
Ming Ng, Steven Vickers
doaj +1 more source
A characterization of trees with equal 2-domination and 2-independence numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$.
Christoph Brause +2 more
doaj +1 more source
Normalization of IZF with Replacement [PDF]
Logical Methods in Computer Science, 2008 ZF is a well investigated impredicative constructive version of Zermelo-Fraenkel set theory. Using set terms, we axiomatize IZF with Replacement, which we call \izfr, along with its intensional counterpart \iizfr.
Wojciech Moczydlowski
doaj +1 more source
IEEE Access, 2023 The dominance-based rough set approach is crucial to the advancement of rough set theory. It gives a more thorough and adaptable framework for knowledge acquisition, information analysis, and DM.
Iftikhar Ul Haq +4 more
doaj +1 more source
PENDIDIKAN KONTRUKTIVISTIK DALAM PENGEMBANGAN KEBERBAKATAN ANAK
Psympathic: Jurnal Ilmiah Psikologi, 2018 Theoretically, the constructive theory uses the cognitive theory as supposition. The constructive theory explains that knowledge is set and developed because of interaction between individual and its environment.
Ujam Jaenudin
doaj +1 more source
Gluing together Proof Environments: Canonical extensions of LF Type Theories featuring Locks [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We present two extensions of the LF Constructive Type Theory featuring monadic locks. A lock is a monadic type construct that captures the effect of an external call to an oracle.
Furio Honsell +3 more
doaj +1 more source
Scientific representation and nominalism: an empiricist view
Principia: An International Journal of Epistemology, 2008 Can a constructive empiricist make sense of scientific representation? Usually, a scientific model is an abstract entity (e.g., formulated in set theory), and scientific representation is conceptualized as an intentional relation between scientific ...
Otávio Bueno
doaj +3 more sources
Borel-piecewise continuous reducibility for uniformization problems [PDF]
Logical Methods in Computer Science, 2017 We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to the notion of
Takayuki Kihara
doaj +1 more source
Non-Determinism and Nash Equilibria for Sequential Game over Partial Order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In sequential games of traditional game theory, backward induction guarantees existence of Nash equilibrium by yielding a sub-game perfect equilibrium.
Stéphane Le Roux
doaj +1 more source