The directed plump ordering

02/15/2022
by   Daniel Gratzer, et al.
0

Based on Taylor's hereditarily directed plump ordinals, we define the directed plump ordering on W-types in Martin-Löf type theory. This ordering is similar to the plump ordering but comes equipped with non-empty finite joins in addition to the usual properties of the plump ordering.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2019

Some ordering properties of highest and lowest order statistics with exponentiated Gumble type-II distributed components

In this paper, we have studied the stochastic comparisons of the highest...
research
08/27/2012

New results of ant algorithms for the Linear Ordering Problem

Ant-based algorithms are successful tools for solving complex problems. ...
research
03/06/2013

Deriving a Minimal I-map of a Belief Network Relative to a Target Ordering of its Nodes

This paper identifies and solves a new optimization problem: Given a bel...
research
10/31/2017

Beyond Shared Hierarchies: Deep Multitask Learning through Soft Layer Ordering

Existing deep multitask learning (MTL) approaches align layers shared be...
research
02/14/2019

Estimation of Gaussian directed acyclic graphs using partial ordering information with an application to dairy cattle data

Estimating a directed acyclic graph (DAG) from observational data repres...
research
08/27/2022

Consistency between ordering and clustering methods for graphs

A relational dataset is often analyzed by optimally assigning a label to...
research
09/27/2020

A Weighted Quiver Kernel using Functor Homology

In this paper, we propose a new homological method to study weighted dir...

Please sign up or login with your details

Forgot password? Click here to reset