Pith. Sign in

RECORD

Parameterized Metatheory for Continuous Markovian Logic

Logic in Computer Science · Submitted 17 Dec 2012

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim The main contribution of this paper is proving that all these analyses can actually be done using a unified complete Boolean framework.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1212.3872 (version 1)
Pith IDOMIRKIGK, Pith's permanent record of this paper and its review
CitationAalborg University), Claus Thrane (Department of Computer Science, Kim G. Larsen (Department of Computer Science, Radu Mardare (Department of Computer Science. "Parameterized Metatheory for Continuous Markovian Logic." arXiv:1212.3872 (2012). https://pith.science/paper/OMIRKIGK
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,336 input tokens, $0.0003 reported.

What the abstract itself states, as probabilities: claims first 0.41 · states limitation 0.11 · human participants 0.02 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.09 · compares with prior results 0.97 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

This paper shows that a classic metalogical framework, including all Boolean operators, can be used to support the development of a metric behavioural theory for Markov processes. Previously, only intuitionistic frameworks or frameworks without negation and logical implication have been developed to fulfill this task. The focus of this paper is on continuous Markovian logic (CML), a logic that characterizes stochastic bisimulation of Markov processes with an arbitrary measurable state space and continuous-time transitions. For a parameter epsilon>0 interpreted as observational error, we introduce an epsilon-parameterized metatheory for CML: we define the concepts of epsilon-satisfiability and epsilon-provability related by a sound and complete axiomatization and prove a series of "parameterized" metatheorems including decidability, weak completeness and finite model property. We also prove results regarding the relations between metalogical concepts defined for different parameters. Using this framework, we can characterize both the stochastic bisimulation relation and various observational preorders based on behavioural pseudometrics. The main contribution of this paper is proving that all these analyses can actually be done using a unified complete Boolean framework. This extends the state of the art in this field, since the related works only propose intuitionistic contexts that limit, for instance, the use of the Boolean logical implication.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 This paper shows that a classic metalogical framework, including all Boolean operators, can be used to support the development of a metric behavioural theory for Markov processes. contribution 0.81 0.93 0.39 asserted 1.00
s1 Previously, only intuitionistic frameworks or frameworks without negation and logical implication have been developed to fulfill this task. gap 0.94 0.03 0.04 asserted 1.00
s2 The focus of this paper is on continuous Markovian logic (CML), a logic that characterizes stochastic bisimulation of Markov processes with an arbitrary measurable state space and continuous-time transitions. background 0.78 0.21 0.04 asserted 1.00
s3 For a parameter epsilon>0 interpreted as observational error, we introduce an epsilon-parameterized metatheory for CML: we define the concepts of epsilon-satisfiability and epsilon-provability related by a sound and complete axiomatization and prove a series of "parameterized" metatheorems including decidability, weak completeness and finite model property. contribution 0.81 0.97 0.12 asserted 1.00
s4 We also prove results regarding the relations between metalogical concepts defined for different parameters. result 0.73 0.94 0.04 asserted 1.00
s5 Using this framework, we can characterize both the stochastic bisimulation relation and various observational preorders based on behavioural pseudometrics. result 0.61 0.91 0.07 asserted 0.74
s6 The main contribution of this paper is proving that all these analyses can actually be done using a unified complete Boolean framework. contribution 1.00 0.93 0.96 asserted 1.00
s7 This extends the state of the art in this field, since the related works only propose intuitionistic contexts that limit, for instance, the use of the Boolean logical implication. interpretation 0.51 0.23 0.17 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.98 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

This paper shows that a classic metalogical framework, including all Boolean operators, can be used to support the development of a metric behavioural theory for Markov processes. Previously, only intuitionistic frameworks or frameworks without negation and logical implication have been developed to fulfill this task. The focus of this paper is on continuous Markovian logic (CML), a logic that characterizes stochastic bisimulation of Markov processes with an arbitrary measurable state space and continuous-time transitions. For a parameter epsilon>0 interpreted as observational error, we introduce an epsilon-parameterized metatheory for CML: we define the concepts of epsilon-satisfiability and epsilon-provability related by a sound and complete axiomatization and prove a series of "parameterized" metatheorems including decidability, weak completeness and finite model property. We also prove results regarding the relations between metalogical concepts defined for different parameters. Using this framework, we can characterize both the stochastic bisimulation relation and various observational preorders based on behavioural pseudometrics. The main contribution of this paper is proving that all these analyses can actually be done using a unified complete Boolean framework. This extends the state of the art in this field, since the related works only propose intuitionistic contexts that limit, for instance, the use of the Boolean logical implication.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.