bsc-leon-vatthauer/thesis/.vscode/ltex.hiddenFalsePositives.en-US.txt

9 lines
2.9 KiB
Text

{"rule":"POSSESSIVE_APOSTROPHE","sentence":"^\\QFurthermore, in mathematical textbooks equality between morphisms is usually taken for granted, i.e. there is some global notion of equality that is clear to everyone.\\E$"}
{"rule":"SENTENCE_WHITESPACE","sentence":"^\\QKleisli').\\E$"}
{"rule":"SENTENCE_WHITESPACE","sentence":"^\\QConstruction.\\E$"}
{"rule":"NO_SPACE_CLOSING_QUOTE","sentence":"^\\Q[inline]Change quotation marks ”\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q”: Given a Kleisli triple \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, we get a monad \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q where \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is the object mapping of the Kleisli triple together with the functor action \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is the morphism family of the Kleisli triple where naturality is easy to show and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is a natural transformation defined as \\E(?:Dummy|Ina|Jimmy-)[0-9]+$"}
{"rule":"IF_IS","sentence":"^\\QLet \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q be a setoid morphism, we define \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q point wise: \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q if \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q if \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q where \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is defined corecursively by: \\E(?:Dummy|Ina|Jimmy-)[0-9]+$"}
{"rule":"ENGLISH_WORD_REPEAT_RULE","sentence":"^\\QThe following conditions hold: There exists a unit morphism \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for any DX, satisfying \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q For any \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q there exists a unique morphism \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q satisfying: \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q There exists a unique morphism \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q satisfying: &&&& &&&& \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q We will make use of the fact that every \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is a final coalgebra: [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] This follows by definition of \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
{"rule":"ENGLISH_WORD_REPEAT_RULE","sentence":"^\\QWe call a morphism \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q guarded if there exists an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q such that the following diagram commutes: &&& &&& \\E(?:Dummy|Ina|Jimmy-)[0-9]+$"}
{"rule":"ENGLISH_WORD_REPEAT_RULE","sentence":"^\\QIt suffices to show \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, because then follows: \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q We prove this by coinduction using: [inline]Change name of morphism &&& &&& \\E(?:Dummy|Ina|Jimmy-)[0-9]+$"}
{"rule":"ENGLISH_WORD_REPEAT_RULE","sentence":"^\\Q[inline]Make this more explicit The first step in both equations can be proven by monicity of \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and then using \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and the dual diagram for \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q which is a direct consequence of \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q: &&&& &&&& \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q the last step holds generally for any \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}