Full Text Available
Access Full Text at Repository
Search Results - computer (sciience OR science)
-
The Computational Complexity of Propositional Cirquent Calculus
Published in Logical Methods in Computer Science (2015)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
Computational Complexity of Smooth Differential Equations
Published in Logical Methods in Computer Science (2014)Subjects: “…Computer Science & Information Science…”
Get full text
-
Computability of Probability Distributions and Characteristic Functions
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
From formulas to cirquents in computability logic
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Graph Model for Imperative Computation
Published in Logical Methods in Computer Science (2010)Subjects: “…Computer Science & Information Science…”
Get full text
-
Computation Tree Logic with Deadlock Detection
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text
-
Exhaustible sets in higher-type computation
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Computably Based Locally Compact Spaces
Published in Logical Methods in Computer Science (2006)Subjects: “…Computer Science & Information Science…”
Get full text
-
The effect of computer-assisted instruction, interest and gender on pupils’ achievement in basic science in primary schools in Ibadan Oyo state, Nigeria
Published 2012Subjects: “…"Computer Assisted Instruction (CAI), Gender, Interest, Achievement in Basic Science "…”
ArticleFull Text AvailableAccess Repository -
Computational expressivity of (circular) proofs with fixed points
Published in Logical Methods in Computer Science (2025)Subjects: “…Computer Science & Information Science…”
Get full text
-
Strong negation in the theory of computable functionals TCF
Published in Logical Methods in Computer Science (2025)Subjects: “…Computer Science & Information Science…”
Get full text
-
Computing with Infinite Objects: the Gray Code Case
Published in Logical Methods in Computer Science (2023)Subjects: “…Computer Science & Information Science…”
Get full text
-
Synthesis of Computable Regular Functions of Infinite Words
Published in Logical Methods in Computer Science (2022)Subjects: “…Computer Science & Information Science…”
Get full text
-
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
Published in Logical Methods in Computer Science (2021)Subjects: “…Computer Science & Information Science…”
Get full text
-
Characterization theorem for the conditionally computable real functions
Published in Logical Methods in Computer Science (2017)Subjects: “…Computer Science & Information Science…”
Get full text
-
Type-based Self-stabilisation for Computational Fields
Published in Logical Methods in Computer Science (2015)Subjects: “…Computer Science & Information Science…”
Get full text
-
Effective zero-dimensionality for computable metric spaces
Published in Logical Methods in Computer Science (2015)Subjects: “…Computer Science & Information Science…”
Get full text
-
Global semantic typing for inductive and coinductive computing
Published in Logical Methods in Computer Science (2014)Subjects: “…Computer Science & Information Science…”
Get full text
-
Representations of measurable sets in computable measure theory
Published in Logical Methods in Computer Science (2014)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Complexity of Infinite Computations In Models of Set Theory
Published in Logical Methods in Computer Science (2009)Subjects: “…Computer Science & Information Science…”
Get full text