Conveners
Logic, Computation and Mathematical Aspects of Computer Science
- Sebastijan Horvat (Department of Mathematics, Faculty of Science, University of Zagreb)
Logic, Computation and Mathematical Aspects of Computer Science
- Domagoj Ševerdija (School of Applied Mathematics and Computer Science)
Logic, Computation and Mathematical Aspects of Computer Science
- Zvonko Iljazović (University of Zagreb)
Inquisitive logic is a generalization of classical logic that can express questions. The language of inquisitive logic is obtained by extending the language of classical propositional logic with a new connective, the inquisitive disjunction. Similarly, inquisitive modal logic, InqML, is a generalization of standard modal logic with $\boxplus$ as the basic modal operator. In this talk, we will...
The basic semantics for the interpretability logics are Veltman models.
R. Verbrugge defined a new relational semantics for interpretability logics, which today is called Verbrugge semantics in her honor.
It has turned out that this semantics has various good properties.
Bisimulations are the basic equivalence relations between Veltman models.
M. Vuković and T. Perkov used them to prove...
Sea transport handles more than 90% of global trade, with over 15% relying on container shipment. Consequently, container transport plays a crucial role in global trade. Containers await loading onto ships in container yards, where limited capacity often leads to stacking containers on top of each other. The sequence for loading these containers onto ships is usually unknown, making it...
The Art Gallery problem is a well-known combinatorial optimization problem in computational geometry that seeks to minimize the number of guards required to ensure visibility within a simple polygon. Specifically, the goal is to identify a minimal set of points (guards) within the polygon such that every internal point remains visible to at least one guard. This visibility criterion is...
A computable metric space $(X, d, \alpha)$ is computably categorical if every two effective separating sequences in $(X, d)$ are equivalent up to isometry. It is known that computable metric space which is not effectively compact is not necessarily computably categorical.
We examine conditions under which an effectively compact metric space is computably categorical.
We show that every...
Topology can play a surprisingly important role in determining the relationship between different aspects of computability of sets in computable metric spaces. In particular, semicomputable sets with certain topological properties will automatically be fully computable. To express this property, we use the notion of computable type: a space $A$ is said to have computable type if every...
This work is part of the research programme that is trying to determine
which conditions render semicomputable subsets of computable metric
spaces computable. In particular, we study generalized topological
graphs, which are obtained by gluing arcs and rays together at their
endpoints. We prove that every semicomputable generalized graph in
a computable metric space can be approximated,...
We examine conditions under which a semicomputable set is computable. It is known that a semicomputable continuum which is chainable from $a$ to $b$ is computable if $a$ and $b$ are computable points. We generalize this result by showing that a semicomputable continuum which is irreducible from $a$ to $b$ is computable if $a$ and $b$ are computable points. We also examine conditions under...
We examine conditions under which a metric basis of a computable metric space has to be computable. We focus mainly on spaces which have one-point metric bases. We prove that in an effectively compact metric space with finitely many connected components any one-point metric basis is computable.
