Sökning: "Carl Åkerman Rydbeck"
Hittade 2 uppsatser innehållade orden Carl Åkerman Rydbeck.
1. Formalisation of Polynomials in Cubical Type Theory Using Cubical Agda
Kandidat-uppsats, Stockholms universitet/Matematiska institutionenSammanfattning : We formalise polynomials over commutative rings in cubical type theory using Cubical Agda as proof assistant. On the basis of a formalisation of polynomials as number sequences with only a finite number of non-zero values, we use higher inductive types to formulate a list-based definition using two point constructors and two path constructors. LÄS MER
2. Epistemic Logic for the Multi-Agent Knowledge-Based Subset Construction
Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : We study multi-agent games on graphs, in relation to the multi-agent knowledgebased subset construction (MKBSC) – a mathematical tool for knowledgebased strategy synthesis. We consider the problem of applying a formal logic related to agent knowledge in this context. LÄS MER